Contents    Page-10    Prev    Next    Page+10    Index   

Extendible Hashing

Extendible hashing can be used when a table is too large to fit in main memory and must be placed on disk.

Extendible hashing is similar to the idea of a B-tree. Instead of having key ranges and disk addresses at the top level, we can hash the key to get an index into a table of disk addresses.