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
- 2. Phillip B. Gibbons
- 3. Todd C. Mowry
- 4. Gary Valentin
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 |
|---|---|---|---|---|
| 80 | Weaving Relations for Cache Performance | 2001 | VLDB | 0.00055721729 |
| 103 | Making B+-Trees Cache Conscious in Main Memory | 2000 | SIGMOD | 0.00049150032 |
| 124 | DBMSs On A Modern Processor: Where Does Time Go? | 1999 | VLDB | 0.00045103515 |
| 233 | A Study of Index Structures for Main Memory Database Management Systems | 1986 | VLDB | 0.00032021526 |
| 238 | Cache Conscious Indexing for Decision-Support in Main Memory | 1999 | VLDB | 0.00031642425 |
| 531 | Improving Index Performance through Prefetching | 2001 | SIGMOD | 0.00020790058 |
| 2,518 | The Value of Merge-Join and Hash-Join in SQL Server | 1999 | VLDB | 8.6089125e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,481 | Buffered Persistence in B+ Trees | 2024 | SIGMOD | 4.7180617e-05 |
| 14,292 | Towards an Optimal Data-Structure: CB-trees | 1984 | VLDB | - |
| 7,995 | BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees | 2023 | VLDB | 4.6109825e-05 |
| 103 | Making B+-Trees Cache Conscious in Main Memory | 2000 | SIGMOD | 0.00049150032 |
| 10,368 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 4.1945683e-05 |
| 5,098 | Multi-Disk B-trees | 1991 | SIGMOD | 5.7007294e-05 |
| 1,809 | Main-Memory Index Structures with Fixed-Size Partial Keys | 2001 | SIGMOD | 0.00010483957 |
| 7,154 | Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index | 2024 | VLDB | 4.815267e-05 |
| 10,562 | FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update | 2025 | VLDB | 4.1945683e-05 |
| 531 | Improving Index Performance through Prefetching | 2001 | SIGMOD | 0.00020790058 |