Linear Hashing
File organisation:
- file of primary data blocks
- file of overflow data blocks
- a register called the split pointer
Uses systematic method of growing data file ...
- hash function "adapts" to changing address range
- systematic splitting controls length of overflow chains
Advantage: does not require auxiliary storage for a directory
Disadvantage: requires overflow pages (splits don't occur on full pages)
|