Dynamic hashing schemes
- 1 July 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 20 (2) , 850-113
- https://doi.org/10.1145/46157.330532
Abstract
A new type of dynamic file access called dynamic hashing has recently emerged. It promises the flexibility of handling dynamic files while preserving the fast access times expected from hashing. Such a fast, dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic file access scheme is needed to support modern database systems. This paper surveys dynamic hashing schemes and examines their critical design issues.Keywords
This publication has 18 references indexed in Scilit:
- Linear hashing with overflow-handling by linear probingACM Transactions on Database Systems, 1985
- Recursive linear hashingACM Transactions on Database Systems, 1984
- Bounded index exponential hashingACM Transactions on Database Systems, 1983
- Performance analysis of linear hashing with partial expansionsACM Transactions on Database Systems, 1982
- Tightly controlled linear hashing without separate overflow storageBIT Numerical Mathematics, 1981
- New file organization based on dynamic hashingACM Transactions on Database Systems, 1981
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Dynamic hashingBIT Numerical Mathematics, 1978
- The Complexity of Trie Index ConstructionJournal of the ACM, 1977
- Key-to-address transform techniquesCommunications of the ACM, 1971