Bounded disorder file organization
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 6 (1) , 79-85
- https://doi.org/10.1109/69.273028
Abstract
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.Keywords
This publication has 14 references indexed in Scilit:
- An exact probability model for finite hash tablesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- File organization using composite perfect hashingACM Transactions on Database Systems, 1989
- Expected behaviour of B+-trees under random insertionsActa Informatica, 1989
- A simple bounded disorder file organization with good performanceACM Transactions on Database Systems, 1988
- Analysis of bounded disorder file organizationPublished by Association for Computing Machinery (ACM) ,1988
- Hashing practice: analysis of hashing and universal hashingPublished by Association for Computing Machinery (ACM) ,1988
- Computing the probability of hash table/urn overflowCommunications in Statistics - Theory and Methods, 1987
- Ubiquitous B-TreeACM Computing Surveys, 1979
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Organization and maintenance of large ordered indexesActa Informatica, 1972