Data partitioning (sharding) membahagikan data merentasi pelbagai pelayan/pangkalan data supaya setiap satu memegang subset — membolehkan penskalaan mendatar data dan beban melangkaui satu pelayan. Memilih cara untuk membahagikan (partition key dan strategi) adalah kritikal.
Apakah partitioning/sharding
PARTITIONING / SHARDING → divide data into pieces (partitions/shards) across multiple
servers, each holding a SUBSET:
→ no single server holds (or is overwhelmed by) all the data
→ scales STORAGE and LOAD horizontally (each shard handles its portion)
→ enables handling data/throughput beyond one machine's capacity
Strategi partitioning
HASH-based → hash the partition key → assign to a shard:
✓ EVEN distribution (avoids hotspots) ✗ range queries hard; resharding is tricky
RANGE-based → partition by value ranges (e.g. A-M, N-Z; date ranges):
✓ efficient range queries ✗ risk of HOTSPOTS (uneven load if data/access is skewed)
DIRECTORY/lookup → a lookup table maps keys to shards (flexible, but the lookup is overhead)
GEOGRAPHIC → partition by region (data locality)
