What's the difference between range-based and hash-based sharding?
Range-based sharding assigns contiguous key ranges to each shard (users A-M on shard 1, N-Z on shard 2) — simple and good for range queries, but prone to hotspots if data or traffic isn't evenly distributed across ranges. Hash-based sharding applies a hash function to the shard key to distribute rows evenly across shards, solving the hotspot problem but making range queries expensive since adjacent keys land on unrelated shards.
Answered in
Database Sharding: What It Actually Costs When You Split the DatabaseSharding scales a database past one machine's limits, but it changes joins, transactions, and query patterns. Here's what each strategy trades away.
Read the full analysisOther questions this article answers
More system design & architecture questions
- How much spare capacity should a gateway keep?
- Why are bounded queues important for availability?
- Should a load balancer always move requests away from an unhealthy server?
- Can a circuit breaker prevent every cascading failure?
- Why does pagination improve API performance beyond just 'smaller responses'?
- Why is asynchronous logging faster than writing logs synchronously?
- When does caching actually help API performance, and when doesn't it?
- Why does payload compression trade CPU time for network time, and when is that worth it?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the System Design & Architecture beat.