In computer science, consistent hashing is a special kind of hashing technique such that when a hash table is resized, only n / m {\displaystyle n/m} keys need to be remapped on average where n {\displaystyle n} is the number of keys and m {\displaystyle m} is the number of slots. Consistent hashing evenly distributes cache keys across shards, even if some of the shards crash or become unavailable.
In computer science, consistent hashing is a special kind of hashing technique such that when a hash table is resized, only n / m {\displaystyle n/m} keys need to be remapped on average where n {\displaystyle n} is the number of keys and m {\displaystyle m} is the number of slots. Consistent hashing evenly distributes cache keys across shards, even if some of the shards crash or become unavailable.
Source: Wikipedia "Consistent hashing" · CC BY-SA 4.0
Share this article: X · Bluesky