HardDesign: Distributed Key-Value Store (Redis/DynamoDB)
For N=3 replicas, W=2 writes, R=2 reads: is strong consistency achieved?
— Tests your understanding of this concept.
Answer Options
ANo, eventual consistency only
BYes, because W+R=4 > N=3, guaranteeing overlap between write and read quorums
CNo, need W=3 for strong consistency
DDepends on network latency
Want to see the correct answer?
Get the answer with a detailed explanation, plus practice 22+ more Design: Distributed Key-Value Store (Redis/DynamoDB) questions with adaptive quizzes and timed interviews.
See the Answer on Guru Sishya →This question is from the Design: Distributed Key-Value Store (Redis/DynamoDB) topic (System Design Cases).
More Design: Distributed Key-Value Store (Redis/DynamoDB) Questions
What does the CAP theorem state?
HardWhat is the advantage of consistent hashing over modulo hashing for data distribution?
HardTwo clients simultaneously write different values to the same key on two different nodes (network partition). How do you resolve this conflict?
HardWhat is the purpose of virtual nodes (vnodes) in consistent hashing?
HardExplain the LSM-tree write path and why it's faster than B-tree for write-heavy workloads.
Hard