CAP theorem
NEED TO SACRIFICE CONSISTENCY OR AVAILABILITY IN THE PRESENCE OF NETWORK PARTITIONS
CAP Theorem; Brewer's theorem; Brewer's conjecture; Cap theorem
In theoretical computer science, the CAP theorem, also named Brewer's theorem after computer scientist Eric Brewer, states that any distributed data store can provide only two of the following three guarantees:Seth Gilbert and Nancy Lynch, "Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services", ACM SIGACT News, Volume 33 Issue 2 (2002), pg. 51–59.