What are the trade-offs between range-based sharding and hash-based sharding?
Range-based sharding assigns contiguous ranges of keys to shards, making range queries efficient but risking write hotspots if sequential IDs or timestamps are used. Hash-based sharding distributes keys uniformly using hash functions, preventing hotspots but making range scans expensive.
Answered in
Database Sharding Guide: Horizontal Partitioning, Shard Keys, and Cross-Shard JoinsWhy databases resist horizontal scaling: deep dive into database sharding, range vs hash vs directory strategies, cross-shard joins, and resharding.
Read the full analysisOther questions this article answers
More system design & architecture questions
- What is the architectural difference between an API Gateway and a Reverse Proxy?
- When should an architecture use Layer 4 instead of Layer 7 load balancing?
- How do edge ingress layers prevent backend cascading thundering herds?
- What algorithm is best for sticky sessions without breaking even distribution?
- How can a CDN improve performance for dynamic requests?
- What is the hardest part of operating behind a CDN?
- How can a CDN help with traffic surges or DDoS attacks?
- What is the difference between a Push CDN and a Pull CDN?
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.