Skip to main content

CAP Theorem

  • Reference work entry
  • First Online:
Encyclopedia of Database Systems

Definition

The CAP theorem states that it is impossible to design a distributed data management platform that provides always consistent (C) data accessed through always available (A) operations if there is the possibility that the set of nodes may partition (P), that is, where there may be nodes which are unable to communicate with each other.

Key Points

The CAP theorem was stated in 1999 by Fox and Brewer [2], and it was proved mathematically by Gilbert and Lynch in 2002 [3]. The CAP theorem is often used to justify NoSQL data platforms that do not keep data consistent, but rather provide eventual consistency (q.v.) or other weak consistency models for replicated data (q.v.).

A common description of the CAP theorem is that a system can have at most two out of the three properties: consistency (C), availability (A), and partition tolerance (P). However, consistency and availability are properties that the system might choose to offer to users, or not; but P is a property of the...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Abadi D. Consistency tradeoffs in modern distributed database system design: CAP is only part of the story. IEEE Comput. 2012;45(2):37–42.

    Article  Google Scholar 

  2. Fox A, Brewer E. Harvest, yield and scalable tolerant systems. In: Proceedings of Workshop on Hot Topics in Operating Systems; 1999. p. 174–8.

    Google Scholar 

  3. Gilbert S, Lynch N. Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News. 2002;33(2):51–9.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alan Fekete .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Fekete, A. (2018). CAP Theorem. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_80644

Download citation

Publish with us

Policies and ethics