Linear hashing with overflow-handling by linear probing
ACM Transactions on Database Systems (TODS)
New file organization based on dynamic hashing
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
File organization: implementation of a method guaranteeing retrieval in one access
Communications of the ACM
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
External hasing with limited internal storage
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator Table
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
A Single-File Version of Linear Hashing with Partial Expansions
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
We present a dynamic external hash method that allows retrieval of a record by only one access to mass storage while maintaining a high load factor. The hash function is based on generalized spiral storage. Both primary and overflow records are allocated to the same file, and file expansion depends on being able to allocate every overflow chain to one bucket. An in-core index, built by means of a signature function, discriminates between primary and overflow records and assures one access to storage in the case of either successful or unsuccessful searching. Simulation results confirm the good expected performance.