00 /What You Will Learn
- Understand how tunable consistency allows per-query tradeoffs between latency and consistency.
- Calculate quorum overlap conditions (R + W > N) using the Pigeonhole Principle.
- Explain why quorum overlap guarantees read freshness for acknowledged writes but is not linearizability.
- Reproduce the stale read anomaly when queries operate under weak consistency (R + W <= N).
- Observe Last-Write-Wins conflict resolution during multi-replica reads.
- Inspect automated background Read Repair healing inconsistent storage nodes.
- Verify how Hinted Handoff captures and replays writes for partitioned replicas upon reconnection.
In this lab the Cassandra cluster is a small Python simulation of the idea. It teaches the behaviour, not the product.
Before you start
Finish Lab 24 (PostgreSQL Sync vs Async Replication) and Lab 25 (Consistent Hashing Ring) first. You should understand data replication, eventual consistency, and how distributed hash rings route partitions to replica nodes. Docker Desktop must be running.