Multilevel Extendible Hashing: A File Structure for Very Large Databases

Authors:
D. H. C. Du;S. -R. Tong
Affiliations:
-;-
Venue:
IEEE Transactions on Knowledge and Data Engineering
Year:
1991

Citing 8
Cited 0

Recursive linear hashing

ACM Transactions on Database Systems (TODS)
Partial match retrieval using recursive linear hashing

BIT
Dynamic file structure for partial match retrieval based on overflow bucket sharing

IEEE Transactions on Software Engineering
New file organization based on dynamic hashing

ACM Transactions on Database Systems (TODS)
Optimal partial-match retrieval when fields are independently specified

ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files

ACM Transactions on Database Systems (TODS)
Dynamic hashing schemes

ACM Computing Surveys (CSUR)
Dynamic File Organizations For Partial Match Retrieval Based on Linear Hashing

Proceedings of the Second International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

A dynamic hashing scheme based on extendible hashing is proposed whose directory can grow into a multilevel directory. The scheme is compared to the extendible hashing and the extendible hashing tree schemes. The simulation results reveal that the proposed scheme is superior than the other two with respect to directory space utilization, especially for files with nonuniform record distribution. This scheme can be easily extended to multikey file systems and also has good performance.