Extendible Hashing
Hashing technique for huge data sets
- optimizes to reduce disk accesses
- each hash bucket fits on one disk block
- better than B-Trees if order is not important
Table contains
- buckets, each fitting in one disk block, with the data
- a directory that fits in one disk block used to hash to the correct bucket