Cap

The CAP theorem, also known as Brewer’s theorem, is a concept in distributed computing that states that it is impossible for a distributed system to simultaneously provide all three of the following guarantees: Consistency: All nodes in the system see the same data at the same time. Availability: Every request made to the system receives a response, without guarantee that it contains the most recent version of the data. Partition tolerance: The system continues to function despite arbitrary message loss or failure of part of the system. In other words, when designing a distributed system, you can only choose two out of the three guarantees, and you have to sacrifice the third. This is because achieving all three is simply not possible in a distributed system. ...