5 ms·
CAP theorem. Choose two, it's a fundamental limitation of scaling a database.
by calmoo 5y ago
CAP theorem. Choose two, it's a fundamental limitation of scaling a database.
- pas 5y agoyes, but no. because in reality what we really want is not true pure AP or CP (or CA, which you can't have anyway) https://www.youtube.com/watch?v=hUd_9FENShA https://www.youtube.com/watch?v=hUd_9FENShA (CAP is a very important result about a very strong assumption of consistency: linearizable events, but for that you can't lose any messages [if I remember it correctly], otherwise the system will become inconsistent)
- calmoo 5y agoThanks for the video, very interesting.
- Thaxll 5y agoGoogle Spanner does the three.
- erik_seaberg 5y ago> The purist answer is “no” because partitions can happen and in fact have happened at Google, and during some partitions, Spanner chooses C and forfeits A. It is technically a CP system. — https://cloud.google.com/blog/products/databases/inside-cloud-spanner-and-the-cap-theorem https://cloud.google.com/blog/products/databases/inside-clou...
- j16sdiz 5y agoCAP theorem. You can't have guarantee for having all three all the time. But you can still have nice thing most of the time. Even better, sometimes you can change which guarantee you need. We can do better then "pick two"
- ralusek 5y agoI've always found CAP theorem to be better described as: Given the need for Partitions, you must choose between prioritizing Consistency or Availability.