BiteSizedChunks.comLearn one small thing at a time.

Course contentsShow

229What is Sharding?
230Why Shard a Database?
231Vertical Partitioning vs Horizontal Partitioning
232Shard Key Selection
233Shard Key Properties
234Data Distribution and Hotspots
235Logical vs Physical Shards
236Shard Mapping and Routing
237Sharding Architecture Patterns
238Query Limitations in Sharded Systems
239When Not to Shard
240Hash-Based Sharding
241Range-Based Sharding
242Directory-Based Sharding
243Geo-Based Sharding
244Entity-Based Sharding
245Composite Shard Keys
246Consistent Hashing for Sharding
247Choosing the Right Shard Key
248Avoiding Hotspots in Sharding
249Time-Based Sharding
250Hybrid Sharding Strategies
251Shard Key Immutability
252Pre-Splitting and Initial Shard Count
253Evaluating Sharding Strategy Tradeoffs
254Cross-Shard Queries and Joins
255Scatter-Gather Pattern
256Hotspots and Uneven Data Distribution
257Celebrity Problem in Social Graphs
258Resharding and Data Migration
259Resharding Strategies: Stop-the-World vs Online
260Consistent Hashing for Minimal Resharding
261Distributed Transactions Across Shards
262Referential Integrity Across Shards
263Shard Key Immutability Problem
264Operational Complexity of Sharded Systems
265Schema Changes in Sharded Environments
266Shard Failure and Partial Outages

229What is Sharding?
230Why Shard a Database?
231Vertical Partitioning vs Horizontal Partitioning
232Shard Key Selection
233Shard Key Properties
234Data Distribution and Hotspots
235Logical vs Physical Shards
236Shard Mapping and Routing
237Sharding Architecture Patterns
238Query Limitations in Sharded Systems
239When Not to Shard
240Hash-Based Sharding
241Range-Based Sharding
242Directory-Based Sharding
243Geo-Based Sharding
244Entity-Based Sharding
245Composite Shard Keys
246Consistent Hashing for Sharding
247Choosing the Right Shard Key
248Avoiding Hotspots in Sharding
249Time-Based Sharding
250Hybrid Sharding Strategies
251Shard Key Immutability
252Pre-Splitting and Initial Shard Count
253Evaluating Sharding Strategy Tradeoffs
254Cross-Shard Queries and Joins
255Scatter-Gather Pattern
256Hotspots and Uneven Data Distribution
257Celebrity Problem in Social Graphs
258Resharding and Data Migration
259Resharding Strategies: Stop-the-World vs Online
260Consistent Hashing for Minimal Resharding
261Distributed Transactions Across Shards
262Referential Integrity Across Shards
263Shard Key Immutability Problem
264Operational Complexity of Sharded Systems
265Schema Changes in Sharded Environments
266Shard Failure and Partial Outages

← System Design

Lesson 241 of 1,919·7. Database Scaling: ShardingPro lesson

Range-Based Sharding

Partition data by key ranges (e.g., A-M, N-Z) for ordered data access but risk uneven load.

This lesson is for subscribers

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

See pricing Back to course