@continuousimprv.bsky.social
Start from where you are. Use what you have. Do what you can.
2PC variant: Presumed Commit Protocol * The `collecting*` record: * Purpose: distinguish two cases * (1) Coordinator fails before making a final decision * (2) Coordinator safely forgot about the transaction
DBMS process models in uniprocessor hardware: (1) process per DBMS worker, (2) thread per DBMS worker, and (3) process pool db.cs.berkeley.edu/papers/fntdb...
Data Replication Implementation and its tradeoff between latency and consistency. www.cs.umd.edu/~abadi/paper...
Paxos Made Simple: Choosing a value and learning a chosen value lamport.azurewebsites.net/pubs/paxos-s...
What if the primary does not always wait for the response from the backup? The data inconsistency between primary and backup is possible. nil.csail.mit.edu/6.824/2015/l...
Gutter Pool: address the failure of a small number of hosts are inaccessible due to a network or server failure pdos.csail.mit.edu/6.824/papers...
Thundering Herd Problem: A SINGLE write triggers MANY frontends read from the database when that key is POPULAR that many frontends need to get that key. pdos.csail.mit.edu/6.824/papers...
Why favour replication in this instance over further dividing the key space? pdos.csail.mit.edu/6.824/papers...
The memcache problems that FB(Meta) aims to solve for reducing the latency of memcache responses pdos.csail.mit.edu/6.824/papers...
What if RO TX 1 read X before the X=10 @10 is replicated to the client local replica? www.youtube.com/watch?v=ZulD...
OSDI12 - Spanner: Google’s Globally-Distributed Database Presentation by Wilson Hsieh www.youtube.com/watch?v=C75k...
Coordination among concurrent actions can be considered to be correct if **every result** is guaranteed to be one that could have been obtained by some **purely serial application** of those same actions.