Extendible hashing with overflow
- 10 December 1982
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 15 (5), 227-232
- https://doi.org/10.1016/0020-0190(82)90123-5
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- The extendible cell method for closest point problemsBIT Numerical Mathematics, 1982
- Order preserving extendible hashing and bucket triesBIT Numerical Mathematics, 1981
- On the average height of trees in digital search and dynamic hashingInformation Processing Letters, 1981
- A note on the analysis of extendible hashingInformation Processing Letters, 1980
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979