What is the difference between vertical partitioning and sharding?
Vertical partitioning moves whole tables, or groups of tables, to separate databases, so each handles a subset of the workload. Sharding splits the rows of one table across databases by a key. The first is easier but caps out at the size of your largest table.
Answered in
The Database Scaling Ladder: What to Try First and What Each Rung CostsIndexes, bigger box, pooling, replicas, caching, vertical split, then sharding. Climb in order, because each rung buys time and adds a new failure mode.
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.