In designing a globally distributed key-value store, what does "quorum-based" reads and writes (e.g., R + W > N) achieve?
Correct! Well done.
Incorrect.
The correct answer is A) By requiring a minimum number of replicas to acknowledge a read (R) or write (W) out of N total replicas, the system can balance consistency, availability, and latency, ensuring overlapping read/write sets help maintain consistency
Correct Answer
By requiring a minimum number of replicas to acknowledge a read (R) or write (W) out of N total replicas, the system can balance consistency, availability, and latency, ensuring overlapping read/write sets help maintain consistency
Systems like Dynamo-style databases use tunable quorum parameters (N, R, W) to trade off consistency and availability — e.g., R + W > N ensures read and write quorums overlap, increasing the likelihood reads see the latest write.