Explore >> Select a destination
|
You are here 
|
compositecode.blog | ||
| | | | |
alexdebrie.com
|
|
| | | | | In this post, understand the different concepts of consistency as applied to distributed databases, as well as some issues with the conversation of consistency. | |
| | | | |
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. | |
| | | | |
xdg.me
|
|
| | | | | If you're reading this blog, it's a good bet that sometime in your life you've had a computer freeze or crash on you. You know that crashes happen. If it's your laptop, you restart and hope for the best. When it's your database, things are a bit more complicated. Historically, a database lived on a single machine. Writes are considered "committed" when they are written to a journal file and flushed to disk. | |
| | | | |
emptysqua.re
|
|
| | | Which consensus algorithm will win? | ||
