Explore >> Select a destination
|
You are here 
|
blog.thislongrun.com | ||
| | | | |
compositecode.blog
|
|
| | | | | The CAP theorem emphasizes the trade-offs between Consistency, Availability, and Partition Tolerance in distributed systems like MongoDB. Prioritizing Availability and Partition Tolerance, MongoDB uses replica sets and sharding for resilience while allowing configurable consistency. Its support for ACID transactions helps maintain data integrity, enabling tailored solutions for varying application requirements. | |
| | | | |
www.adamconrad.dev
|
|
| | | | | Ch 9 of my book club review of Designing Data-Intensive Applications by Martin Kleppmann. | |
| | | | |
blog.dtornow.com
|
|
| | | | | The CAP theorem is too simplistic and too widely misunderstood to be of much use for characterizing systems. Therefore I ask that we retire all references to the CAP theorem, stop talking about the CAP theorem, and put the poor thing to rest Martin Kleppmann In 2000, Eric Brewer introduced the CAP Conjecture during his keynote address Towards Robust Distributed Systems at the Principles of Distributed Computing conference. Brewer posited that a distributed system cannot achieve Consistency, Availability, and Partition Tolerance simultaneously. | |
| | | | |
decomposition.al
|
|
| | | by Natasha Mittal ? edited by Devashish Purandare and Lindsey Kuper | ||
