Extendible hashing
From Wikipedia, the free encyclopedia
Extendible hashing is a type of hash system which treats a hash as a bit string, and uses a trie for bucket lookup. Because of the hierarchal nature of the system, re-hashing is an incremental operation (done one bucket at a time, as needed). This means that time-sensitive applications are less affected by table growth than by standard full-table rehashes.
[edit] See also
[edit] External links
- Paul E. Black, Extendible hashing at the NIST Dictionary of Algorithms and Data Structures.
- Extendible Hashing at University of Nebraska
- Extendible Hashing notes at Arkansas State University
- Extendible hashing—a fast access method for dynamic files - an early paper on the use of extendible hashing for file lookup.
