|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| D.H.C. Du, S.-R. Tong, "Multilevel Extendible Hashing: A File Structure for Very Large Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 3, no. 3, pp. 357-370, September, 1991. | |||
| BibTex | x | ||
| @article{ 10.1109/69.91065, author = {D.H.C. Du and S.-R. Tong}, title = {Multilevel Extendible Hashing: A File Structure for Very Large Databases}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {3}, number = {3}, issn = {1041-4347}, year = {1991}, pages = {357-370}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.91065}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Knowledge and Data Engineering TI - Multilevel Extendible Hashing: A File Structure for Very Large Databases IS - 3 SN - 1041-4347 SP357 EP370 EPD - 357-370 A1 - D.H.C. Du, A1 - S.-R. Tong, PY - 1991 KW - 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 VL - 3 JA - IEEE Transactions on Knowledge and Data Engineering ER - | |||
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.
[1] A. V. Aho and J. D. Ullman, "Optimal partial match retrieval when fields are independently specified,"ACM TODS, vol. 4, no. 2, pp. 168-179, June 1979.
[2] R. J. Enbody and H. C. Du, "Dynamic hashing systems,"ACM Computing Surveys, vol. 20, no. 2, June 1988.
[3] R. Fagan et al., "Extendible Hashing--A Fast-Access Method for Dynamic Files,"ACM Trans. Database Systems, Vol. 4, No. 3, Sept. 1979, pp. 315-344.
[4] J. K. Mullin, "Tightly controlled linear hashing without separate overflow storage,"BIT, vol. 20, no. 4, pp. 390-400, 1981.
[5] P. Larson, "Dynamic hashing,"BIT, vol. 18, pp. 184-201, 1978.
[6] P. Larson, "Linear hashing with partial expansions," inProc. 6th Conf. Very Large Data Bases, Montreal, 1980, pp. 224-232.
[7] W. Litwin, "Virtual hashing: A dynamically changing scheme," inProc. 4th Conf. Very Large Databases, Berlin, 1978, pp. 517-523.
[8] W. Litwin, "Linear hashing: A new tool for file and table addressing," inProc. 6th Int. Conf. Very Large Data Bases, Montreal, 1980, pp. 212-223.
[9] J. Llyod and K. Ramamohanaroa, "Partial match retrieval for dynamic files,"BIT, vol. 22, pp. 150-168, 1982.
[10] K. Ramamohanarao and R. Sacks-Davis, "Recursive linear hashing."ACM Trans. Database Syst., vol. 9, no. 3, pp. 369-391, Sept. 1984.
[11] K. Ramamohanarao and R. Sacks-Davis, "Partial match retrieval using recursive linear hashing."BIT, vol. 25, pp. 477-484, 1985.
[12] M. Scholl, "New file organizations based on dynamic hashing,"ACM Trans. Database Syst., vol. 6, Mar. 1981.
[13] T. S. Yuen and H. C. Du, "Dynamic file structures for partial match retrieval based on overflow bucket sharing,"IEEE Trans. Software Eng., vol. SE-12, no. 8, pp. 801-810, Aug. 1986.
[14] T. S. Yuen and H. C. Du, "Dynamic file organization for partial match retrieval based on linear hashing," inProc. 1986 Int. Conf. Data Eng., pp. 116-123.