The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - September (1991 vol.3)
pp: 357-370
ABSTRACT
<p>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.</p>
INDEX TERMS
file structure; very large databases; multilevel directory; extendible hashing; extendible hashing tree; simulation results; directory space utilization; nonuniform record distribution; multikey file systems; database management systems; file organisation
CITATION
D.H.C. Du, S.-R. Tong, "Multilevel Extendible Hashing: A File Structure for Very Large Databases", IEEE Transactions on Knowledge & Data Engineering, vol.3, no. 3, pp. 357-370, September 1991, doi:10.1109/69.91065
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool