Issue No. 01 - February (1994 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.273028
<p>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.</p>
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. Ramakrishna, "Bounded Disorder File Organization," in IEEE Transactions on Knowledge & Data Engineering, vol. 6, no. , pp. 79-85, 1994.