Two is Better Than One: The Case for 2-Tree for Skewed Data Sets
Summary: 2-Tree splits an index into hot (in-memory) and cold (on-disk) trees, using lightweight bidirectional migration and low-cost access tracking to enable per-tree tuning. Yields 15x (B+tree)/20x (LSM) memory-utilization gains and up to 1.7x throughput on Zipfian IO-bound workloads while preserving range-scan performance. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xinjing Zhou
- 2. Xiangyao Yu
- 3. Goetz Graefe
- 4. Michael Stonebraker
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,840 | LeanStore: A High-Performance Storage Engine for NVMe SSDs | 2024 | VLDB | 4.9109345e-05 |
| 7,154 | Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index | 2024 | VLDB | 4.815267e-05 |
| 8,428 | Towards Buffer Management with Tiered Main Memory | 2024 | SIGMOD | 4.5158105e-05 |
| 9,185 | Practical DB-OS Co-Design with Privileged Kernel Bypass | 2025 | SIGMOD | 4.3792034e-05 |
| 10,038 | Understanding Robustness Issues of Updatable Learned Indexes: [Experiments & Analysis] | 2026 | SIGMOD | 4.1945683e-05 |
| 10,773 | From FASTER to F2: Evolving Concurrent Key-Value Store Designs for Large Skewed Workloads | 2025 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 16 of 16 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
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,995 | BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees | 2023 | VLDB | 4.6109825e-05 |
| 14,292 | Towards an Optimal Data-Structure: CB-trees | 1984 | VLDB | - |
| 13,073 | Experiments With B-Tree Reorganization | 1980 | SIGMOD | 4.1945683e-05 |
| 7,099 | PIM-tree: A Skew-resistant Index for Processing-in-Memory | 2023 | VLDB | 4.8326366e-05 |
| 1,809 | Main-Memory Index Structures with Fixed-Size Partial Keys | 2001 | SIGMOD | 0.00010483957 |
| 11,704 | Splaying Log-Structured Merge-Trees | 2018 | SIGMOD | 4.1945683e-05 |
| 5,098 | Multi-Disk B-trees | 1991 | SIGMOD | 5.7007294e-05 |
| 7,343 | LSM-Trees and B-Trees: The Best of Both Worlds | 2019 | SIGMOD | 4.7568442e-05 |
| 10,368 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 4.1945683e-05 |
| 638 | On B-tree Indices for Skewed Distributions | 1992 | VLDB | 0.00018798677 |