Glossary Entry

High Availability (HA) for a Data Lakehouse: Storage, Catalog, and Engines

High availability means designing a system to stay up through failures by removing single points of failure. See how HA applies to storage, catalogs, engines.

Written by Alex Merced

High Availability (HA) is the practice of designing a system so it keeps serving requests when individual components fail. In practice that means finding every single point of failure (SPOF), adding redundancy for it, and automating failover so recovery does not wait for a person to wake up.

Availability targets are usually written as “nines”:

TargetAllowed downtime per year
99% (two nines)about 3.65 days
99.9% (three nines)about 8.8 hours
99.99% (four nines)about 53 minutes
99.999% (five nines)about 5.26 minutes

Each extra nine costs more in redundancy and operations, so the right target depends on what downtime costs the business. Analytical platforms often run at three or four nines, while payment and trading systems aim higher.

Building Blocks of HA

1. Redundancy Across Failure Domains

One server is never highly available. Cloud deployments spread replicas across several Availability Zones (AZs), which are separate data centers within a region with independent power and networking. If one AZ fails, replicas in the others keep serving traffic.

2. Health Checks and Automated Failover

Redundancy only helps if the system detects failure and switches over. In a PostgreSQL cluster managed by Patroni, the primary holds a leader lock in a distributed configuration store (etcd, Consul, or ZooKeeper). If the primary stops renewing the lock, a replica is promoted once the lock expires. With Patroni’s defaults (a 30 second leader TTL and a 10 second loop), failover takes tens of seconds, and clients reconnect through a load balancer or virtual IP that points at the new primary.

3. HA Is Not Disaster Recovery

HA handles routine failures inside a region with little or no data loss. Disaster recovery handles losing a whole region or corrupting data, and is measured by recovery point and recovery time objectives. You need both.

The CAP Theorem Tradeoff

Distributed databases such as Cassandra and DynamoDB face the CAP theorem: during a network partition, a system must choose between staying available and staying consistent. A system that keeps accepting writes on both sides of a partition stays available but lets the sides diverge, and has to reconcile conflicts when the network heals. A system that refuses writes on one side stays consistent but is partly unavailable.

High Availability in a Lakehouse Stack

A lakehouse has several layers, and each has its own failure modes. Availability of the whole is limited by the weakest layer.

LayerWhat failsTypical HA approach
Object storage (S3, ADLS, GCS)Disks, racks, an AZProvider replicates across AZs; S3 Standard is designed for 99.99% availability with a 99.9% SLA
Catalog (Apache Polaris, Nessie, Glue, Unity Catalog)Catalog service or its databaseRun several stateless catalog replicas behind a load balancer, backed by an HA database; managed catalogs handle this for you
Query engines (Dremio, Trino, Spark)Coordinator or executor nodesExecutor failures retry tasks; check whether your engine supports coordinator failover
Streaming ingestion (Kafka, Flink)Brokers, jobsReplicated topics; Flink checkpoints so a restarted job resumes without duplicating Iceberg commits

The catalog deserves the most attention. Every Iceberg read and commit goes through it, so a catalog outage stops queries even when storage is healthy. For cross-region designs, see Disaster Recovery for Iceberg Tables and Governing Iceberg Tables Across Regions.

Summary

High availability comes from redundancy across failure domains plus automated detection and failover. In a lakehouse, apply that thinking layer by layer: storage is usually the most available part, and the catalog and engine coordinators are where single points of failure tend to hide.

Learn More

To learn more about the Data Lakehouse, read The Lakehouse Built for Everyone by Alex Merced. You can find this and other books by Alex Merced at books.alexmerced.com.

Related Terms

What is Disaster Recovery (DR)?

Disaster recovery (DR) is the plan for restoring data systems after a major outage or loss. Learn how RPO, RTO, immutable backups, and air-gapping shape it.

What is CAP Theorem?

The CAP Theorem is the foundational mental model for data engineering architecture. It proves that there is no such thing as a 'perfect' distributed database.

System Architecture: Principles and How They Shape a Data Lakehouse

System architecture is the high-level design of a system's components and how they interact. See its core tradeoffs and how they map to lakehouse layers.

Trino and Apache Iceberg: How It Compares to Spark and Dremio

Trino is an open source distributed SQL engine that queries data where it lives. See how it reads and writes Iceberg tables and compares to Spark and Dremio.

What is Streaming Ingestion?

Streaming ingestion loads data continuously as it is generated, via a broker like Kafka and a processor like Flink, into sinks such as Apache Iceberg tables.

What is Data Lakehouse?

A data lakehouse is an architecture that adds warehouse features like ACID transactions and schema enforcement to data lake files via open formats like Iceberg.

Apache ZooKeeper: What It Does and Whether Your Lakehouse Needs It

Apache ZooKeeper is a coordination service for distributed systems. See what it does, why Kafka replaced it with KRaft, and which lakehouse tools still use it.

What is Data Replication?

Data replication is the continuous copying of data across servers or regions for availability and read scale. Compare synchronous and asynchronous replication.

What is Google Cloud Storage (GCS)?

Google Cloud Storage is Google Cloud's object storage service. Learn about multi-region buckets, storage classes, lifecycle rules, and GCS as lakehouse storage.

Work with Alex