A Critique of the CAP Theorem

  title={A Critique of the CAP Theorem},
  author={Martin Kleppmann},
  • Martin Kleppmann
  • Published 2015
  • Computer Science
  • ArXiv
  • The CAP Theorem is a frequently cited impossibility result in distributed systems, especially among NoSQL distributed databases. In this paper we survey some of the confusion about the meaning of CAP, including inconsistencies and ambiguities in its definitions, and we highlight some problems in its formalization. CAP is often interpreted as proof that eventually consistent databases have better availability properties than strongly consistent databases; although there is some truth in this, we… CONTINUE READING
    15 Citations

    Tables and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Paper Mentions

    Inadequacies of CAP Theorem
    • 2
    • PDF
    A Survey on NoSQL Stores
    • 63
    NoSQL Databases: Yearning for Disambiguation
    • 2
    • PDF
    Towards Quantifiable Boundaries for Elastic Horizontal Scaling of Microservices
    • 8
    • PDF
    Managing Consistency in e-Government Transactions: the Case of Uruguay
    • 4


    Consistency , Availability , and Convergence
    • 93
    • PDF
    Weak Consistency: A Generalized Theory and Optimistic Implementations for Distributed Transactions
    • 203
    • PDF
    CAP twelve years later: How the "rules" have changed
    • 491
    • Highly Influential
    • PDF
    Probabilistically Bounded Staleness for Practical Partial Quorums
    • 185
    • PDF
    Sacrificing serializability to attain high availability of data in an unreliable network
    • 156
    • PDF
    Highly Available Transactions: Virtues and Limitations
    • 176
    • PDF
    Session guarantees for weakly consistent replicated data
    • 453
    • PDF
    Limitations of Highly-Available Eventually-Consistent Data Stores
    • 48
    • PDF