CAP Theorem



Similar Posts:


linkedin
github
slack

Q: What is CAP Theorem? See definition in wikipedia.

  1. Consistency: Every read receives the most recent write or an error
  2. Availability: Every request receives a (non-error) response – without guarantee that it contains the most recent write
  3. Partition tolerance: The system continues to operate despite an arbitrary number of messages being dropped (or delayed) by the network between nodes

Q: Does it mean I can only get two of CAP?

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.

  • Traditional RDMBS usually choose consistency over availability.
  • NoSQL DB choose availability over consistency.

Q: What is BASE?

Basically Available, Soft State, Eventual Consistency


Q: Different types of consistency models?

strong consistency, sequential consistency, eventual consistency, etc.


Q: What does CAP Theorem tell us?

It is impossible for a web service to provide the three following guarantees : Consistency, Availability and Partition-tolerance.


Share It, If You Like It.

Leave a Reply

Your email address will not be published. Required fields are marked *