Consistent hashing shine technique ne don ba data a kan nodes (servers) wanda ya rage gadewa lokacin da aka saka ko cire nodes — ba kamar simple hashing ba, wanda ya sake jajagege most keys lokacin da node lamba ya canja. Yana da mahimmanci don distributed caches, databases, da load distribution.
Matsalar da simple hashing ta kawo da ita
Simple approach: node = hash(key) % N (N = number of nodes)
✗ when N CHANGES (add/remove a node), N changes → MOST keys remap to different nodes →
massive data movement / cache invalidation (almost everything moves!)
→ adding/removing a server causes huge disruption → bad for dynamic distributed systems.
