Extendible hashing - WikipediaExtendible hashing is a type of hash system which treats a hash as a bit string and uses a trie for bucket lookup.[1] Because of the hierarchical 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. Extendible hashing was described by R
http://www.inf.unibz.it/dis/teaching/DMS/lecturenotes/dms03.pdf
http://db.ucsd.edu/CSE232W99/Indexing/sld034.htm
