5.14 Consistent Hashing
5.14 Consistent Hashing Problem You need to distribute keys across a changing set of nodes so that when nodes are added or removed, only a small fraction of keys move. A standard hash table uses: index = hash(key) mod n When n changes, most keys are reassigned. This is unacceptable in systems like caches, distributed storage, or sharded services where moving data is expensive. Solution Map both keys and nodes...