Horizontally partition data across nodes — shard keys, rebalancing, and cross-shard queries for scalable data systems.
Five passes over the same idea, each from a different angle. Do them in order, or jump to whichever you need.
Sharding splits data across multiple database instances based on a shard key. Strategies include hash-based, range-based, and directory-based sharding. Key challenges: choosing the right shard key, handling hotspots, cross-shard joins, rebalancing when adding nodes, and maintaining global indexes.
Where this topic shows up outside its home domain:
