GHOST: Fine Granularity Buffering of Index Pages
Summary: GHOST introduces dual, fine-grained B+-tree buffering: hot root-to-leaf paths plus a splay tree of pointers to frequently accessed leaves, preserving “ghost” access paths after internal pages are evicted. It substantially outperforms prior index-buffering schemes (ILRU, OLRU) across practical workloads. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Cheng Hian Goh (National University of Singapore)
- 2. Hong Chin Ooi (National University of Singapore)
- 3. Dennis Sim (National University of Singapore)
- 4. Kian-Lee Tan (National University of Singapore)
BibTeX Citation
@article{goh_vldb99,
title = {{GHOST: Fine Granularity Buffering of Index Pages}},
author = {Goh, Cheng Hian and Ooi, Hong Chin and Sim, Dennis and Tan, Kian-Lee},
journal = {PVLDB},
series = {{VLDB} '99},
pages = {339--350},
year = {1999}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0020210012 |
| 135 | An Evaluation of Buffer Management Strategies for Relational Database Systems | 1985 | VLDB | 0.00030209257 |
| 231 | The LRU-K Page Replacement Algorithm For Database Disk Buffering | 1993 | SIGMOD | 0.00023846898 |
| 609 | A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model | 1982 | VLDB | 0.00015792907 |
| 864 | The Pyramid-Technique: Towards Breaking the Curse of Dimensionality | 1998 | SIGMOD | 0.00013522522 |
| 2,590 | Extensible Buffer Management of Indexes | 1992 | VLDB | 8.3696843e-05 |
| 7,663 | Index Access with a Finite Buffer | 1987 | VLDB | 5.5725248e-05 |
| 12,940 | Fast High-Dimensional Data Search in Incomplete Databases | 1998 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,681 | Efficient Concurrency Control in Multidimensional Access Methods | 1999 | SIGMOD |
| 2 | 545 | Improving Index Performance through Prefetching | 2001 | SIGMOD |
| 3 | 8,689 | Adaptive Index Structures | 2002 | VLDB |
| 4 | 6,742 | Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index | 2024 | VLDB |
| 5 | 219 | A Study of Index Structures for Main Memory Database Management Systems | 1986 | VLDB |
| 6 | 13,030 | Estimating Page Fetches for Index Scans with Finite LRU Buffers | 1994 | SIGMOD |
| 7 | 2,590 | Extensible Buffer Management of Indexes | 1992 | VLDB |
| 8 | 1,110 | Buffering Accesses to Memory-Resident Index Structures | 2003 | VLDB |
| 9 | 9,324 | Main-Memory Operation Buffering for Efficient R-Tree Update | 2007 | VLDB |
| 10 | 7,663 | Index Access with a Finite Buffer | 1987 | VLDB |