CAP Theorem

Consistency

Availability

Partition Tolerance

The CAP theorem, also known as Brewer's theorem, states that it is impossible for a distributed system to simultaneously provide all three of the following guarantees:

Consistency

Consistency means that all clients see the same data at the same time, no matter which node they connect to.

Availability

Availability means that any client making a request for data gets a response, even if one or more nodes are down.

Partition Tolerance

Partition tolerance means that the cluster must continue to work despite any number of communication breakdowns between nodes in the system.

Consistency: Not Achieved 🚫

Availability: Not Achieved 🚫

Partition Tolerance: Not Achieved 🚫

Select the properties you want to achieve, but remember, you can't have all three!