CAP theorem
Teorema CAP
- Date
- 2000-2002 · confidence high
- Place
- Berkeley, California, United States
- Credited to
- Eric Brewer; formally proved by Seth Gilbert and Nancy Lynch in 2002
- Field
- Knowledge & symbols
What was discovered
States that no distributed data store can simultaneously guarantee consistency, availability and partition tolerance: at most it can offer two of the three. It shaped the design of distributed and NoSQL databases.
Brewer proposed it as a conjecture at a conference (PODC) in 2000; Gilbert and Lynch gave it a formal proof in 2002.
What it led to
- The rise of eventually-consistent NoSQL databases
- A reference framework for designing distributed systems