Analysis of bounded disorder file organization

Authors:
M. V. Ramakrishna;P. Mukhopadhyay
Affiliations:
Computer Science Department, Michigan State University, East Lansing, MI;Computer Science Department, Michigan State University, East Lansing, MI
Venue:
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Year:
1988

Citing 10
Cited 5

A probability model for overflow sufficiency in small hash tables

Communications of the ACM
Partial expansions for file organizations with an index

ACM Transactions on Database Systems (TODS)
Perfect hashing for external files

Perfect hashing for external files
External hashing with limited internal storage

Journal of the ACM (JACM)
File organization using composite perfect hashing

ACM Transactions on Database Systems (TODS)
External perfect hashing

SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
File organization: implementation of a method guaranteeing retrieval in one access

Communications of the ACM
An Exact Probability Model for Finite Hash Tables

Proceedings of the Fourth International Conference on Data Engineering
The Bounded Disorder Access Method

Proceedings of the Second International Conference on Data Engineering
A linear probing sort and its analysis(Preliminary Draft)

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing

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)
Performance analysis of file organizations that use multi-bucket data leaves with partial expansions (extended abstract)

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Performance analysis of file organizations that use multibucket data leaves with partial expansions

ACM Transactions on Database Systems (TODS)
Bounded Disorder File Organization

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently Litwin and Lomet proposed the Bounded Disorder (BD) file organization which uses a combination of hashing and tree indexing Lomet provided an approximate analysis with a mention of the difficulty involved in exact modeling and analysis. The performance analysis of the method involves solving a classical sequential occupancy problem. We encountered this problem in our attempt to obtain a general model for single access and almost single access retrieval methods developed in the recent years. In this paper, we develop a probability model and present some preliminary results of the exact analysis.