BiteSizedChunks.comLearn one small thing at a time.

Course contentsShow

338What is a Key-Value Store?
339Key-Value Store Operations
340In-Memory vs Persistent Key-Value Stores
341Data Types and Value Complexity
342No Secondary Indexes or Query Language
343Time-to-Live and Expiration
344Performance Characteristics
345Use Cases for Key-Value Stores
346When Not to Use Key-Value Stores
347Redis Data Structures Overview
348Redis Single-Threaded Architecture
349Redis In-Memory Storage Model
350Redis Persistence: RDB Snapshots
351Redis Persistence: AOF Logs
352Redis Replication Architecture
353Redis Sentinel for High Availability
354Redis Cluster Sharding
355Redis as a Cache
356Redis as a Session Store
357Redis Pub/Sub for Real-Time Messaging
358Redis for Rate Limiting
359Redis for Leaderboards and Counting
360What Makes a Key-Value Store Distributed
361Partitioning in Distributed Key-Value Stores
362Consistent Hashing for Key-Value Stores
363Virtual Nodes and Load Distribution
364Replication in Distributed Key-Value Stores
365Tunable Consistency with Quorum Reads and Writes
366Sloppy Quorums and Hinted Handoff
367Vector Clocks and Conflict Detection
368Conflict Resolution Strategies
369Anti-Entropy and Merkle Trees
370Distributed Key-Value Store Architectures in Practice
371The Dynamo Paper: Context and Motivation
372Consistent Hashing in Dynamo
373Replication and Quorum in Dynamo
374Vector Clocks for Conflict Detection
375Sloppy Quorum and Hinted Handoff
376Anti-Entropy with Merkle Trees
377Eventual Consistency and Application Reconciliation
378Dynamo's Influence on Modern Systems

338What is a Key-Value Store?
339Key-Value Store Operations
340In-Memory vs Persistent Key-Value Stores
341Data Types and Value Complexity
342No Secondary Indexes or Query Language
343Time-to-Live and Expiration
344Performance Characteristics
345Use Cases for Key-Value Stores
346When Not to Use Key-Value Stores
347Redis Data Structures Overview
348Redis Single-Threaded Architecture
349Redis In-Memory Storage Model
350Redis Persistence: RDB Snapshots
351Redis Persistence: AOF Logs
352Redis Replication Architecture
353Redis Sentinel for High Availability
354Redis Cluster Sharding
355Redis as a Cache
356Redis as a Session Store
357Redis Pub/Sub for Real-Time Messaging
358Redis for Rate Limiting
359Redis for Leaderboards and Counting
360What Makes a Key-Value Store Distributed
361Partitioning in Distributed Key-Value Stores
362Consistent Hashing for Key-Value Stores
363Virtual Nodes and Load Distribution
364Replication in Distributed Key-Value Stores
365Tunable Consistency with Quorum Reads and Writes
366Sloppy Quorums and Hinted Handoff
367Vector Clocks and Conflict Detection
368Conflict Resolution Strategies
369Anti-Entropy and Merkle Trees
370Distributed Key-Value Store Architectures in Practice
371The Dynamo Paper: Context and Motivation
372Consistent Hashing in Dynamo
373Replication and Quorum in Dynamo
374Vector Clocks for Conflict Detection
375Sloppy Quorum and Hinted Handoff
376Anti-Entropy with Merkle Trees
377Eventual Consistency and Application Reconciliation
378Dynamo's Influence on Modern Systems

← System Design

Lesson 373 of 1,919·10. NoSQL: Key-Value StoresPro lesson

Replication and Quorum in Dynamo

How Dynamo replicates data across N nodes and uses quorum reads/writes (R+W>N) for tunable consistency.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.

See pricing Back to course