Partial expansions for file organizations with an index
ACM Transactions on Database Systems (TODS)
A simple bounded disorder file organization with good performance
ACM Transactions on Database Systems (TODS)
Hashing practice: analysis of hashing and universal hashing
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
File organization using composite perfect hashing
ACM Transactions on Database Systems (TODS)
Expected behaviour of B+-trees under random insertions
Acta Informatica
Analysis of bounded disorder file organization
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Performance of B±Trees with Partial Expansions
IEEE Transactions on Knowledge and Data Engineering
An Exact Probability Model for Finite Hash Tables
Proceedings of the Fourth International Conference on Data Engineering
Information Processing Letters
| Hi-index | 0.00 |
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.