Skip to content

Latest commit

 

History

History
10 lines (9 loc) · 955 Bytes

cap-theorem.md

File metadata and controls

10 lines (9 loc) · 955 Bytes
  • Consistency: every read receives the most recent write or an error.
  • Availability: every request receives a response that is not an error.
  • Partition tolerance: the system continues to operate despite an arbitrary number of messages being dropped (or delayed) by the network between nodes
  • CAP theorem implies that in the presence of a network partition, one has to choose between consistency and availability
  • CAP is frequently misunderstood as if one has to choose to abandon one of the three guarantees at all times. In fact, the choice is really between consistency and availability only when a network partition or failure happens; at all other times, no trade-off has to be made.
  • ACID databases choose consistency over availability.
  • BASE systems choose availability over consistency.