Architecture Expert
Sharding strategie¶
ShardingDatabaseScaling 3 min read
Horizontální dělení dat. Hash, range, consistent hashing.
Strategies¶
- Hash: shard = hash(key) % N — rovnoměrné, ale re-hash during změně
- Range: A-M → shard 1, N-Z → shard 2 — range queries, risk hot spots
- Consistent Hashing: minimalizuje viauny dat
Challenges¶
- Cross-shard queries jsou drahé
- Rebalancing requires migraci
- Špatný shard key = hot spots
- ACID napříč shardy je složitý
Summary¶
Sharding je last resort. Nejdřív: optimalizujte queries, indexy, read replicas, vertikální scaling.
Need Help with Implementation?¶
Our team has experience designing and implementing modern architectures. We’re happy to help.