This Article 
 Bibliographic References 
 Add to: 
Bounded Disorder File Organization
February 1994 (vol. 6 no. 1)
pp. 79-85

The bounded disorder file organization proposed by W. Litwin and D.B. Lomet (1987) uses a combination of hashing and tree indexing. Lomet provided an approximate analysis with the mention of the difficulty involved in exact modeling of data nodes, which motivated this work. In an earlier paper (M.V. Ramakrishna and P. Mukhopadhyay, 1988) we provided an exact model and analysis of the data nodes, which is based on the solution of a classical sequential occupancy problem. After summarizing the analysis of data nodes, an alternate file growth method based on repeated trials using universal hashing is proposed and analyzed. We conclude that the alternate file growth method provides simplicity and significant improvement in storage utilization.

[1] R. Baeza-Yates, "Bounded disorder: The effect of index," Univ. of Chile, Santiago, Chile, Tech. Rep., 1989.
[2] R. Baeza-Yates and P.A. Larson, "Performance of B+-trees with partial expansions,"IEEE Trans. Knowledge Data Eng., vol. 1, no. 2, pp. 248-257, 1989.
[3] R. Baeza-Yates, "The expected behavior of B+-trees,"Acta Inform., vol. 26, pp. 439-471, 1989.
[4] R. Bayer and E. M. McCreight, "Organization and maintenance of large ordered indexes,"Acta Informat., vol. 1. no. 3, pp. 173-189, 1972.
[5] L. J. Carter and M. L. Wegman, "Universal classes of hash functions,"J. Comput. Syst. Sci., vol. 18, no. 2, pp. 143-145, 1979.
[6] C. Comer, "The ubiquitousB-trees,"ACM Comput. Surveys, vol. 11, no. 2, pp. 121-136, June 1979.
[7] 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.
[8] W. Litwin and D. B. Lomet, "A new method for fast data searches with keys,"IEEE Software, vol. 4, no. 2, pp. 16-24, 1987.
[9] D. Lomet, "Partial expansions for file organizations with an index,"ACM Trans. Database Syst., vol. 12, no. 1, pp. 65-84, 1987.
[10] D. B. Lomet, "A simple bounded disorder file organization with good performance,"ACM Trans. Database Syst., vol. 13, no. 4, pp. 525-551, Dec. 1988.
[11] W. Litwin, "Linear hashing: A new tool for file and table addressing," inProc. 6th Conf. VLDB, Montreal, Canada, pp. 212-223, 1980.
[12] M. V. Ramakrishna and P. A. Larson, "File organization using composite perfect hashing,"ACM Trans. on Database Syst., vol. 14, no. 2, pp. 231-263, 1989.
[13] M. V. Ramakrishna, "Computing the probability of hash table/urn overflow,"Commun. Statist., vol. A16, no. 11, pp. 3343-3353, 1987.
[14] M. V. Ramakrishna and P. Mukhopadhyay, "Analysis of bounded disorder file organization," inProc. ACM Symp. Principles of Database Systems, Austin, TX, pp. 117-125, 1988.
[15] M. V. Ramakrishna, "Hashing in practice, analysis of hashing and universal hashing," inProc. ACM-SIGMOD Conf., Chicago, pp. 191-200, 1988.
[16] M. V. Ramakrishna, "An exact probability model for finite hash tables," inProc. IEEE Conf. on Data Engineering, Los Angeles, pp. 362-368, 1988.

Index Terms:
file organisation; trees (mathematics); indexing; bounded disorder file organization; hashing; tree indexing; approximate analysis; data nodes; exact model; classical sequential occupancy problem; alternate file growth method; repeated trials; universal hashing; storage utilization
M.V. Ramakrishna, "Bounded Disorder File Organization," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 1, pp. 79-85, Feb. 1994, doi:10.1109/69.273028
Usage of this product signifies your acceptance of the Terms of Use.