Skip to content

Instantly share code, notes, and snippets.

@abhinavece

abhinavece/CAP Theorem in shorts

Created July 16, 2020 21:17
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save abhinavece/b624ca44a3b17db2992076e218839003 to your computer and use it in GitHub Desktop.
Save abhinavece/b624ca44a3b17db2992076e218839003 to your computer and use it in GitHub Desktop.
Download ZIP
Raw
CAP Theorem in shorts
The CAP theorem states that when a total partition (a network failure, for
example) or a temporary partition (the latency between data replication after a write
request, a full GC in the JVM, etc) happens in a distributed system, it has to choose
between consistency or availability. If the distributed system picks consistency over
availability, it will be unavailable until the partition is fixed. On the other hand, if it
picks availability over consistency, it will return a response for a request but this
may not contain the most up to date data.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment