The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
The design and implementation of INGRES
ACM Transactions on Database Systems (TODS)
Modeling the storage architectures of commercial database systems
ACM Transactions on Database Systems (TODS)
Associative searching in multiple storage units
ACM Transactions on Database Systems (TODS)
External hashing with limited internal storage
Journal of the ACM (JACM)
Performance comparison of extendible hashing and linear hashing techniques
SIGSMALL '90 Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems
A compendium of key search references
ACM SIGIR Forum
A dynamic hash method with signature
ACM Transactions on Database Systems (TODS)
Performance comparison of extendible hashing and linear hashing techniques
ACM SIGSMALL/PC Notes
A multidimensional digital hashing scheme for files with composite keys
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Analysis of dynamic hashing with deferred splitting
ACM Transactions on Database Systems (TODS)
Partial-match retrieval using hashing and descriptors
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)
Interpolation-based index maintenance
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
External hasing with limited internal storage
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
An Efficient File Structure for Document Retrieval in the Automated Office Environment
IEEE Transactions on Knowledge and Data Engineering
Multilevel Extendible Hashing: A File Structure for Very Large Databases
IEEE Transactions on Knowledge and Data Engineering
Linear Spiral Hashing for Expansible Files
IEEE Transactions on Knowledge and Data Engineering
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
Performance Evaluation of Lazy Deletion Methods in R-trees
Geoinformatica
| Hi-index | 0.00 |
New file organizations based on hashing and suitable for data whose volume may vary rapidly recently appeared in the literature. In the three schemes which have been independently proposed, rehashing is avoided, storage space is dynamically adjusted to the number of records actually stored, and there are no overflow records. Two of these techniques employ an index to the data file. Retrieval is fast and storage utilization is low.In order to increase storage utilization, we introduce two schemes based on a similar idea and analyze the performance of the second scheme. Both techniques use an index of much smaller size. In both schemes, overflow records are accepted. The price which has to be paid for the improvement in storage utilization is a slight access cost degradation.