Journal of the ACM (JACM)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
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
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)
Journal of the ACM (JACM)
File organization: implementation of a method guaranteeing retrieval in one access
Communications of the ACM
Handbook of Algorithms
External hasing with limited internal storage
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
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
Linear hashing with separators—a dynamic hashing scheme achieving one-access
ACM Transactions on Database Systems (TODS)
File organization using composite perfect hashing
ACM Transactions on Database Systems (TODS)
A compendium of key search references
ACM SIGIR Forum
Dynamic partitioning of signature files
ACM Transactions on Information Systems (TOIS)
Analysis of bounded disorder file organization
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimal Distribution of Signatures in Signature Hashing
IEEE Transactions on Knowledge and Data Engineering
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
| Hi-index | 0.00 |
The following problem is studied: How, and to what extent, can the retrieval speed of external hashing be improved by storing a small amount of extra information in internal storage? Several algorithms that guarantee retrieval in one access are developed and analyzed. In the first part of the paper, a restricted class of algorithms is studied, and a lower bound on the amount of extra storage is derived. An algorithm that achieves this bound, up to a constant difference, is also given. In the second part of the paper a number of restrictions are relaxed and several more practical algorithms are developed and analyzed. The last one, in particular, is very simple and efficient, allowing retrieval in one access using only a fixed number of bits of extra internal storage per bucket. The amount of extra internal storage depends on several factors, but it is typically very small: only a fraction of a bit per record stored. The cost of inserting a record is also analyzed and found to be low. Taking all factors into account, this algorithm is highly competitive for applications requiring very fast retrieval.