Extendible hashing
Extendible hashing is a type of hash system which treats a hashcode as a bit string, and uses a trie for bucket lookup. Because of the heirarchical 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.
See also
External links
- NIST's Dictionary of Algorithms and Data Structures: Extendible hashing
- Extendible Hashing at University of Nebraska
- Extendible Hashing notes at University of Arkansas
- Extendible hashing—a fast access method for dynamic files - an early paper on the use of extendible hashing for file lookup.
 | This computer science article is a stub. You can help Wikipedia by expanding it. |