Order preserving extendible hashing and bucket tries
- 1 December 1981
- journal article
- research article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 21 (4), 419-435
- https://doi.org/10.1007/bf01932839
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- New file organization based on dynamic hashingACM Transactions on Database Systems, 1981
- Optimal Expected-Time Algorithms for Closest Point ProblemsACM Transactions on Mathematical Software, 1980
- External Hashing Schemes for Collections of Data StructuresJournal of the ACM, 1980
- Storing a sparse tableCommunications of the ACM, 1979
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Priority queue administration by sublist indexThe Computer Journal, 1979
- Dynamic hashingBIT Numerical Mathematics, 1978
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- Hashing functionsThe Computer Journal, 1975
- Identifier Search Mechanisms: A Survey and Generalized ModelACM Computing Surveys, 1974