Meet OceanBase AI Lakebase, the unified database for operational data, real-time analytics, and AI.

Explore ->

Meet OceanBase AI Lakebase, the unified database for operational data, real-time analytics, and AI. Explore ->

The Multi-Cloud DR Playbook: Architecture Patterns for Cross-Cloud Database Resilience

Database High Availability

Technical analysis of database high availability metrics, cluster topologies, consensus replication protocols, automated failover mechanisms, and OceanBase Paxos fault tolerance.

Published 2026-10-28
Updated 2026-10-28Total 270 resources recorded

1. Engineering Metrics and Core Principles of Database High Availability

Database high availability defines the capability of a database management system to remain continuously operational and accessible despite hardware failures, software faults, network disruptions, or scheduled maintenance. In mission-critical enterprise computing, availability is quantified through strict Service Level Agreements (SLAs) expressed as uptime percentages. For example, a 99.999 percent availability standard limits total unplanned downtime to less than 5.26 minutes per calendar year. Evaluating database high availability relies on four foundational engineering metrics: Mean Time Between Failures (MTBF), Mean Time to Recovery (MTTR), Recovery Point Objective (RPO), and Recovery Time Objective (RTO).

RPO measures the maximum tolerable volume of committed transactional data lost during an unplanned outage, whereas RTO measures the maximum elapsed time required to restore database read and write service after a failure occurs. Designing for strict database high availability requires eliminating single points of failure across every layer of the infrastructure stack. Redundancy must span physical compute servers, memory modules, non-volatile storage arrays, network switches, power distribution units, and logical database kernel processes.

2. Cluster Topologies: Shared-Everything, Shared-Disk, and Shared-Nothing

Database engines implement high availability through three primary structural topologies: shared-everything, shared-disk, and shared-nothing architectures. Shared-everything systems run a monolithic database instance on a single server backed by local hardware redundancy. If the primary storage array fails or the operating system panics, the entire database becomes unavailable until a standby server takes over. Shared-disk architectures decouple compute instances from persistent storage by connecting multiple active compute nodes to a centralized Storage Area Network (SAN). While shared-disk clusters survive individual compute node crashes, the shared storage network remains a single point of failure, and cross-node cache fusion introduces severe distributed lock overhead.

Modern distributed databases utilize a shared-nothing architecture to achieve superior fault isolation and horizontal scalability. In a shared-nothing cluster, both compute execution and data storage are partitioned across independent physical servers. Nodes share neither memory nor disk hardware, communicating exclusively through high-speed network protocols. Each data partition is replicated across multiple autonomous nodes located in separate fault domains, ensuring that a complete hardware failure on one server never corrupts or blocks data residing on peer nodes.

3. Data Replication Modes and Majority Quorum Consensus

Synchronizing transactional state across redundant replicas governs the trade-off between write latency and data durability in a database high availability deployment. Asynchronous replication returns a commit acknowledgement to the client as soon as the primary node writes its local redo log, transferring log records to standby nodes in the background. Although asynchronous replication minimizes write latency, a primary node crash results in unrecoverable data loss (RPO > 0). Fully synchronous replication blocks transaction commits until every replica confirms disk persistence, guaranteeing RPO = 0 but allowing a single slow or disconnected standby node to stall the entire cluster.

Distributed database engines resolve this dilemma by embedding majority quorum consensus protocols, such as Paxos or Raft, directly into the transaction replication pipeline. Under a quorum consensus model, a partition group consisting of three or five replicas commits a transaction as soon as a strict majority (for example, two out of three replicas) persists the write-ahead log. The cluster tolerates minority node failures without degrading write availability or losing committed transactions, achieving both continuous uptime and strict linearizable consistency.

4. Automated Failover Orchestration and Split-Brain Prevention

Extending database high availability across availability zones and geographical regions requires automated failure detection and failover orchestration. Decentralized heartbeat monitors and bounded lease mechanisms continuously verify the responsiveness of partition leaders. When a primary node experiences a hardware crash or network isolation, its leadership lease expires automatically. Surviving replicas initiate a consensus leader election protocol to promote a synchronized follower replica to the new leader role without human intervention.

During network partitions, an isolated primary node might attempt to continue processing write requests while surviving nodes elect a new leader, resulting in split-brain data corruption. Consensus quorum voting strictly prevents split-brain scenarios because an isolated minority partition cannot assemble the majority votes required to commit writes or renew leadership leases. Meanwhile, a stateless database proxy layer tracks cluster topology changes in real time and reroutes active client SQL connections to the newly elected leader transparently.

5. OceanBase Implementation of Financial-Grade Database High Availability

OceanBase delivers financial-grade database high availability through a native shared-nothing distributed architecture integrated with the Paxos consensus protocol. In an OceanBase cluster, relational tables are horizontally partitioned into tablets, each managed by an independent multi-replica Paxos consensus group. Transaction redo logs must be durably persisted to a majority quorum of Paxos replicas before OceanBase returns a commit confirmation to the application. This quorum mechanism guarantees that even if an entire server node, rack, or availability zone fails, all committed transactional states survive intact on peer replicas, strictly enforcing RPO = 0.

When an unexpected hardware or network fault occurs, OceanBase initiates automated Paxos leader re-election across affected partition groups. Because follower replicas maintain synchronized write-ahead log streams, newly elected leaders resume read and write operations within seconds, achieving a cluster RTO of less than eight seconds (RTO < 8s). Client traffic routed through the OceanBase Database Proxy (OBProxy) switches to active leaders seamlessly without dropping application sessions. Furthermore, OceanBase supports flexible multi-datacenter deployment topologies—including Three-Data-Center across Two-Region (3DC2R) and Five-Data-Center across Three-Region (5DC3R) architectures—alongside online schema changes and rolling software upgrades, ensuring uninterrupted service availability for core enterprise workloads.

contactus
Browse all Encyclopedia Entries

This channel is the index for all site-wide encyclopedia entries, with a total of 270 entries recorded.

This page is one of them: Database High Availability

Start Building on OceanBase Now