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
8003
Venue
VLDB
Year
1987
Pagerank
5.5725248e-05
Overall Rank
7,663 | 47.43%
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 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
12,605 Towards Efficient Main-Memory Use For Optimum Tree Index Update 2008 VLDB 5.093636e-05
12,911 GHOST: Fine Granularity Buffering of Index Pages 1999 VLDB 5.093636e-05
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