The idea to keep with you
Eliminate hot-partition skew by suffixing heavy-hitter keys with a bounded salt and merging reads via parallel scatter-gather.
TL;DR30-second simplified summary▾
Deterministic hash(key) % N routing collapses when Zipfian skew concentrates traffic on a single celebrity key. Adaptive salted sharding appends a bounded salt #0..#(K-1) only to detected hot keys, spreading write load uniformly across K shards while executing bounded O(K) parallel scatter-gather on reads.
From patterns to decisions.
Eliminate hot-partition skew by suffixing heavy-hitter keys with a bounded salt and merging reads via parallel scatter-gather.
Full walkthrough · 7 stages
01
foundation
Stage 1: Core Mental Model.
02
foundation
Stage 2: Production Failure Mode.
03
intermediate
Stage 3: Naive Baseline & Bottleneck.
04
intermediate
Stage 4: Hardened Architecture.
05
intermediate
Stage 5: Reference Implementation & Rollback.
06
advanced
Stage 6: Complexity & Capacity Bounds.
07
advanced
Stage 7: Operational Runbook & Telemetry.
Practice · Explain the consequences
Practice: Make the trade-off yourself.
Question 1 of 3
Score: 0/3What primary invariant prevents failure in Salted Sharding & Bounded Scatter-Gather (Check 1)?
Recommended Learning Flow