Week 8, Monday (March 3, 2014)

Answers to some midterm questions

(In class)

Full answers vailable on-line later in the week.

Guide to reading for Wednesday

Read Distributed Algorithms in NoSQL Databases, from the beginning up to but not including, “Anti-Entropy Protocols, Gossips”.

What to look for: This post is dense, filled with detail, and the diagrams are complex. We won’t be studying every approach Katsov describes. The key point is the tradeoffs from weakest consistency (eventual consistency) to strongest. What is the price you pay to get the strongest consistency? What is the programming complexity you must put up with if you accept the execution efficiency of weak consistency?