Database Paper Browser

Back to papers

Analysis of Bounded Disorder file organization

Summary: Presents an exact probabilistic model for the Bounded Disorder (BD) file organization of Litwin and Lomet, which mixes hashing with tree indexing, replacing prior approximate analysis. Solves the underlying sequential occupancy problem to derive preliminary exact performance results for single-access and almost-single-access retrieval methods. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
821
Venue
PODS
Year
1988
Pagerank
6.2885419e-05
Overall Rank
4,318 | 69.97%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
730 Trie Hashing 1981 SIGMOD 0.00017483181
4,086 External Perfect Hashing 1985 SIGMOD 6.4608969e-05
Previous Page 1 / 1 Next

Semantically Similar Papers