Linear hashing with overflow-handling by linear probing
ACM Transactions on Database Systems (TODS)
External hashing with limited internal storage
Journal of the ACM (JACM)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Performance analysis of linear hashing with partial expansions
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
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
Spiral Storage: Incrementally Augmentable Hash Addressed Storage
A compendium of key search references
ACM SIGIR Forum
Fast search in main memory databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
The VLDB Journal — The International Journal on Very Large Data Bases - Persistent object systems
Alternating Hashing for Expansible Files
IEEE Transactions on Knowledge and Data Engineering
Linear Spiral Hashing for Expansible Files
IEEE Transactions on Knowledge and Data Engineering
Repeating History Beyond ARIES
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
A Performance Evaluation of OID Mapping Techniques
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Performance evaluation of linear hash structure model in a nested transaction environment
Journal of Systems and Software
Data reduction through early grouping
CASCON '94 Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
| Hi-index | 0.00 |
A new dynamic hashing scheme is presented. Its most outstanding feature is that any record can be retrieved in exactly one disk access. This is achieved by using a small amount of supplemental internal storage that stores enough information to uniquely determine the current location of any record. The amount of internal storage required is small: typically one byte for each page of the file. The necessary address computation, insertion, and expansion algorithms are presented and the performance is studied by means of simulation. The new method is the first practical method offering one-access retrieval for large dynamic files.