- A special kind of hashing technique such that when a hash table is resized, only n/m keys need to be remapped on average where n is the number of keys and m 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, because the mapping between the keys and the slots is defined by a modular operation. ← Wikipedia
- Related terms: Rolling hash · Hash table · Hash function · Number sign
- Previous term: Consistency model
- Next term: Console
- Random term: Multithreading (webglossary.info/random 🎲)