Database Paper Browser

Back to papers

Index Access With A Finite Buffer

Summary: Analyzes fault rates for index-driven access under finite memory using a B-tree; shows LRU is suboptimal and derives ILRU (always better, esp. for small buffers) and OLRU (optimal under uniform densities). Discusses Zipf-like distributions and extension to other hierarchical index structures. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7812
Venue
VLDB
Year
1987
Pagerank
4.7529612e-05
Overall Rank
7,357 | 48.82%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

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