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
External hasing with limited internal storage
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
External hashing with limited internal storage
Journal of the ACM (JACM)
Linear hashing with separators—a dynamic hashing scheme achieving one-access
ACM Transactions on Database Systems (TODS)
Hashing practice: analysis of hashing and universal hashing
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
File organization using composite perfect hashing
ACM Transactions on Database Systems (TODS)
A compendium of key search references
ACM SIGIR Forum
A dynamic hash method with signature
ACM Transactions on Database Systems (TODS)
Dynamic partitioning of signature files
ACM Transactions on Information Systems (TOIS)
Effective clustering of objects stored by linear hashing
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Analysis of bounded disorder file organization
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Optimal Distribution of Signatures in Signature Hashing
IEEE Transactions on Knowledge and Data Engineering
Using Tries to Eliminate Pattern Collisions in Perfect Hashing
IEEE Transactions on Knowledge and Data Engineering
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
| Hi-index | 48.22 |
A new file organization method that guarantees retrieval of any record in one access is tested on two existing files, producing empirical results that compare favorably with theoretical predictions. The description of the method includes the algorithms used for implementing the required hashing and signature functions.