Utilization of B-trees with Inserts, Deletes and Modifies
Summary: Extends Yao-style analysis to B-tree equilibrium under parameterized mixes of inserts and deletes (modifies as delete+insert), deriving per-level split/merge probabilities and accounting for intra-node "ghost" items. Shows utilization can fall to ~39% for heavy modify workloads, gives a rule-of-thumb for split probability and two analytical models (one more accurate by modeling ghosted items). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 11 of 11 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,685 | Performance of B-Tree Concurrency Control Algorithms | 1991 | SIGMOD | 0.00010099878 |
| 1,713 | Write-Optimized B-Trees | 2004 | VLDB | 0.00010029279 |
| 1,881 | LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory | 2020 | VLDB | 9.6458052e-05 |
| 2,562 | Lazy Updates for Distributed Search Structure | 1993 | SIGMOD | 8.4781648e-05 |
| 2,875 | Optimal Column Layout for Hybrid Workloads | 2019 | VLDB | 8.0765364e-05 |
| 5,474 | A Framework for the Performance Analysis of Concurrent B-tree Algorithms | 1990 | PODS | 6.2732796e-05 |
| 7,787 | Buffered Persistence in B+ Trees | 2024 | SIGMOD | 5.6035684e-05 |
| 7,880 | Contention and Space Management in B-Trees | 2021 | CIDR | 5.5938953e-05 |
| 11,010 | Breathing New Life into An Old Tree: Resolving Logging Dilemma of B+-tree on Modern Computational Storage Drives | 2024 | VLDB | 5.1725247e-05 |
| 12,169 | No Bits Left Behind | 2011 | CIDR | 5.1725247e-05 |
| 12,583 | Transaction support for indexed summary views | 2004 | SIGMOD | 5.1725247e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,057 | Multi-Disk B-trees | 1991 | SIGMOD | 6.4473481e-05 |
| 12,852 | New Concurrency Control Algorithms for Accessing and Compacting B-Trees | 1994 | VLDB | 5.1725247e-05 |
| 10,380 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 5.1725247e-05 |
| 7,880 | Contention and Space Management in B-Trees | 2021 | CIDR | 5.5938953e-05 |
| 13,826 | Relaxed Multi-Way Trees with Group Updates | 2001 | PODS | - |
| 2,991 | The Performance Of A Multiversion Access Method | 1990 | SIGMOD | 7.9360002e-05 |
| 458 | Concurrent Operations on B-Trees with Overtaking | 1985 | PODS | 0.0001818345 |
| 1,685 | Performance of B-Tree Concurrency Control Algorithms | 1991 | SIGMOD | 0.00010099878 |
| 5,474 | A Framework for the Performance Analysis of Concurrent B-tree Algorithms | 1990 | PODS | 6.2732796e-05 |
| 13,086 | Experiments With B-Tree Reorganization | 1980 | SIGMOD | 5.1725247e-05 |