Multilevel extendible hashing: a file structure for very large databases

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on knowledge and data engineering 1991-09, Vol.3 (3), p.357-370
Main Authors: Du, D.H.C., Tong, S.-R.
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
Computer science
control theory
systems
Database systems
Exact sciences and technology
File systems
Information retrieval
Information systems. Data bases
Memory organisation. Data processing
Software
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
ISSN:1041-4347
1558-2191
DOI:10.1109/69.91065