Contention and Space Management in B-Trees
Summary: Introduces Contention Split to detect and split hot B-tree nodes, boosting concurrency on many-core CPUs. Proposes XMerge, a lazy neighbor-merge to raise space utilization and reduce read/write amplification, lightweight and easy to integrate. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Adnan Alhomssi
- 2. Viktor Leis
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,454 | Is Scalable OLTP in the Cloud a Solved Problem? Analyzing Data Access for Distributed OLTP Architectures | 2023 | CIDR | 5.0510162e-05 |
| 6,838 | LeanStore: A High-Performance Storage Engine for NVMe SSDs | 2024 | VLDB | 4.906223e-05 |
| 8,165 | Scalable and Robust Snapshot Isolation for High-Performance Storage Engines | 2023 | VLDB | 4.5680112e-05 |
| 8,595 | OptiQL: Robust Optimistic Locking for Memory-Optimized Indexes | 2023 | SIGMOD | 4.4844188e-05 |
| 8,653 | Adaptive Hybrid Indexes | 2022 | SIGMOD | 4.4696663e-05 |
| 10,193 | Predictive Translation: High-Performance Buffer Management Without the Trade-Offs | 2026 | SIGMOD | 4.1905499e-05 |
| 10,255 | How to Write to SSDs | 2026 | VLDB | 4.1905499e-05 |
| 10,380 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 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 |
|---|---|---|---|---|
| 282 | Concurrent Operations on B-Trees with Overtaking | 1985 | PODS | 0.00029054939 |
| 4,317 | Compact B-Trees | 1979 | SIGMOD | 6.2824978e-05 |
| 7,990 | BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees | 2023 | VLDB | 4.6086117e-05 |
| 7,199 | Online B-Tree Merging | 2005 | SIGMOD | 4.7984795e-05 |
| 9,410 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD | 4.3399748e-05 |
| 5,239 | A Framework for the Performance Analysis of Concurrent B-tree Algorithms | 1990 | PODS | 5.6060584e-05 |
| 11,010 | Breathing New Life into An Old Tree: Resolving Logging Dilemma of B+-tree on Modern Computational Storage Drives | 2024 | VLDB | 4.1905499e-05 |
| 10,380 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 4.1905499e-05 |
| 1,573 | Performance of B-Tree Concurrency Control Algorithms | 1991 | SIGMOD | 0.00011293832 |
| 12,852 | New Concurrency Control Algorithms for Accessing and Compacting B-Trees | 1994 | VLDB | 4.1905499e-05 |