Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance
Summary: fpB+-Trees nest cache-optimized subtrees inside disk-optimized B+-Trees to balance cache and I/O. Disk-first and cache-first variants deliver cache gains (1.1–1.8x search, 4.2x scans, 20x updates) with minimal I/O impact; jump-pointer arrays prefetch leaves to speed range scans (2.5–5x on DB2). (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Shimin Chen (Carnegie Mellon University)
- 2. Phillip B. Gibbons (AT&T; Intel)
- 3. Todd C. Mowry (Carnegie Mellon University)
- 4. Gary Valentin (IBM)
BibTeX Citation
@inproceedings{chen_sigmod02,
title = {{Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance}},
author = {Chen, Shimin and Gibbons, Phillip B. and Mowry, Todd C. and Valentin, Gary},
series = {{SIGMOD} '02},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/564691.564710},
url = {https://dl.acm.org/doi/10.1145/564691.564710},
year = {2002}
}
Incoming Citations (Sorted by Pagerank)
Showing 16 of 16 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 48 | Weaving Relations for Cache Performance | 2001 | VLDB | 0.00043805923 |
| 69 | Making B+-Trees Cache Conscious in Main Memory | 2000 | SIGMOD | 0.00037950385 |
| 110 | DBMSs On A Modern Processor: Where Does Time Go? | 1999 | VLDB | 0.00032700879 |
| 207 | Cache Conscious Indexing for Decision-Support in Main Memory | 1999 | VLDB | 0.00024970987 |
| 229 | A Study of Index Structures for Main Memory Database Management Systems | 1986 | VLDB | 0.00023911856 |
| 548 | Improving Index Performance through Prefetching | 2001 | SIGMOD | 0.00016569534 |
| 2,994 | The Value of Merge-Join and Hash-Join in SQL Server | 1999 | VLDB | 7.7710643e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,075 | Buffered Persistence in B+ Trees | 2024 | SIGMOD |
| 2 | 7,325 | BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees | 2023 | VLDB |
| 3 | 14,803 | Towards an Optimal Data-Structure: CB-trees | 1984 | VLDB |
| 4 | 69 | Making B+-Trees Cache Conscious in Main Memory | 2000 | SIGMOD |
| 5 | 9,998 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD |
| 6 | 5,234 | Multi-Disk B-trees | 1991 | SIGMOD |
| 7 | 1,841 | Main-Memory Index Structures with Fixed-Size Partial Keys | 2001 | SIGMOD |
| 8 | 6,484 | Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index | 2024 | VLDB |
| 9 | 11,237 | FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update | 2025 | VLDB |
| 10 | 548 | Improving Index Performance through Prefetching | 2001 | SIGMOD |