CAP Theorem

It is impossible for a distributed data store to simultaneously provide more than two out of three guarantees.

Table of Contents

• Consistency: Every read receives the most recent write or an error.
• Availability: Every request receives a (non-error) response, without guarantee that it contains the most recent write.
• Partition Tolerance: System continues to operate despite an arbitrary number of messages being dropped/delayed by network.