Skip to content

Instantly share code, notes, and snippets.

Avatar
👨‍💻
Coding

Abhinav kumar singh abhinavece

👨‍💻
Coding
View GitHub Profile
View 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.
View 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.
View Spring Related Concepts