notexOPENOverview
Notex/Systems/Consistent hashing
05.03LESSON 03 OF 13 · 1 MIN READ

Consistent hashing

Always free to read
SECTION VIDEOConsistent hashing

Video coming soon. Start with the reading below.

COMING SOON

Quoted from Wikipedia: "Consistent hashing is a special kind of hashing such that when a hash table is re-sized and consistent hashing is used, only k/n keys need to be remapped on average, where k is the number of keys, and n is the number of slots. In contrast, in most traditional hash tables, a change in the number of array slots causes nearly all keys to be remapped [1]”.

Progress is saved on this device.
KEEP EXPLORING

One note leads to another.

Back to the library →
⌕
Search across the entire library ⌘ K