CockroachDB and High Availability
In the context of the CAP Theorem, CockroachDB is designed to be a CP (Consistent & Partition Tolerant) database that guarantees data will be correct and will survive partition failure. The “A” in CAP (Availability) is defined as “Every request receives a (non-error) response, without the guarantee that it contains the most recent write”. CockroachDB can serve almost every request and guarantees every write. Further, there are several components of CockroachDB's database architecture that allow it to deliver five 9s high availability for any application, whether it is deployed on a single rack, across a data center, or even spanning regions.
This brief delivers a high-level outline of these characteristics and how we deliver high availability in CockroachDB. If you would like a deep dive into the architecture of our database, please visit our documentation.