Webster's Dictionary describes CAP theorem as:
The CAP theorem states that a distributed system can provide only two of the following three guarantees at the same time:
Consistency (C): All nodes see the same data at the same time.
Availability (A): Every request receives a response, even if some nodes fail.
Partition Tolerance (P): The system continues to operate despite network partitions.
In essence: You can’t have all three—only two at once.
For example:
CA: Consistent and available (but not partition tolerant).
CP: Consistent and partition tolerant (may sacrifice availability).
AP: Available and partition tolerant (may sacrifice consistency).
This is a cutting edge consistent and partition tolerant database.
This database stores records with 11 9s of durability and 0 9s of availability.