DBScholar

Back to papers

Index Access with a Finite Buffer

Summary: Analyzes buffer-fault rates for repeated clustered-index access in B-trees under finite memory. Shows conventional LRU is suboptimal; introduces ILRU (uniformly superior, especially with small buffers) and OLRU (optimal for uniform reference densities), with Zipfian behavior discussed. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
h97366e8f2c5f654d
Venue
VLDB
Year
1987
Pagerank
5.862438e-05
Overall Rank
6,170 | 58.52%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{sacco_vldb87,
        title = {{Index Access with a Finite Buffer}},
        author = {Sacco, Giovanni Maria},
        journal = {PVLDB},
        series = {{VLDB} '87},
        year = {1987}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 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.

Previous Page 1 / 1 Next

Semantically Similar Papers