HardDesign: Distributed Key-Value Store (Redis/DynamoDB)

What does the CAP theorem state?

— Tests your understanding of this concept.

Answer Options

AA distributed system can have all three: consistency, availability, and partition tolerance
BA distributed system can guarantee at most two of: consistency, availability, and partition tolerance
CAll distributed systems must sacrifice availability
DCAP stands for Create, Archive, Purge

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).

Learn Design: Distributed Key-Value Store (Redis/DynamoDB)→Browse All Questions

More Design: Distributed Key-Value Store (Redis/DynamoDB) Questions

What is the advantage of consistent hashing over modulo hashing for data distribution?

Hard

For N=3 replicas, W=2 writes, R=2 reads: is strong consistency achieved?

Hard

Two clients simultaneously write different values to the same key on two different nodes (network partition). How do you resolve this conflict?

Hard

What is the purpose of virtual nodes (vnodes) in consistent hashing?

Hard

Explain the LSM-tree write path and why it's faster than B-tree for write-heavy workloads.

Hard