Performance analysis of linear hashing with partial expansions
ACM Transactions on Database Systems (TODS)
A Single-File Version of Linear Hashing with Partial Expansions
VLDB '82 Proceedings of the 8th International Conference on Very Large Data Bases
Linear hashing with overflow-handling by linear probing
ACM Transactions on Database Systems (TODS)
Communications of the ACM
Twin grid files: space optimizing access schemes
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A dynamic signature technique for multimedia databases
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
A compendium of key search references
ACM SIGIR Forum
Dynamic partitioning of signature files
ACM Transactions on Information Systems (TOIS)
Distributed file organization with scalable cost/performance
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
Self-organizing scheme for file storage
CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
ACM Computing Surveys (CSUR)
Multilevel Extendible Hashing: A File Structure for Very Large Databases
IEEE Transactions on Knowledge and Data Engineering
New Order Preserving Access Methods for Very Large Files Derived from Linear Hashing
IEEE Transactions on Knowledge and Data Engineering
Atlas: A Nested Relational Database System for Text Applications
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
Optimal Linear Hashing Files for Orthogonal Range Retrieval
COMPSAC '96 Proceedings of the 20th Conference on Computer Software and Applications
| Hi-index | 0.02 |
A modification of linear hashing is proposed for which the conventional use of overflow records is avoided. Furthermore, an implementation of linear hashing is presented for which the amount of physical storage claimed is only fractionally more than the minimum required. This implementation uses a fixed amount of in-core space. Simulation results are given which indicate that even for storage utilizations approaching 95 percent, the average successful search cost for this method is close to one disk access.