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,458 | Is Scalable OLTP in the Cloud a Solved Problem? Analyzing Data Access for Distributed OLTP Architectures | 2023 | CIDR | 5.0558683e-05 |
| 6,840 | LeanStore: A High-Performance Storage Engine for NVMe SSDs | 2024 | VLDB | 4.9109345e-05 |
| 8,192 | Scalable and Robust Snapshot Isolation for High-Performance Storage Engines | 2023 | VLDB | 4.562388e-05 |
| 8,655 | Adaptive Hybrid Indexes | 2022 | SIGMOD | 4.4739554e-05 |
| 9,454 | OptiQL: Robust Optimistic Locking for Memory-Optimized Indexes | 2023 | SIGMOD | 4.3391522e-05 |
| 10,193 | Predictive Translation: High-Performance Buffer Management Without the Trade-Offs | 2026 | SIGMOD | 4.1945683e-05 |
| 10,255 | How to Write to SSDs | 2026 | VLDB | 4.1945683e-05 |
| 10,368 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 4.1945683e-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.00029057817 |
| 4,324 | Compact B-Trees | 1979 | SIGMOD | 6.2885419e-05 |
| 7,995 | BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees | 2023 | VLDB | 4.6109825e-05 |
| 7,200 | Online B-Tree Merging | 2005 | SIGMOD | 4.8030945e-05 |
| 5,239 | A Framework for the Performance Analysis of Concurrent B-tree Algorithms | 1990 | PODS | 5.6106291e-05 |
| 9,404 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD | 4.3441378e-05 |
| 11,007 | Breathing New Life into An Old Tree: Resolving Logging Dilemma of B+-tree on Modern Computational Storage Drives | 2024 | VLDB | 4.1945683e-05 |
| 10,368 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 4.1945683e-05 |
| 1,573 | Performance of B-Tree Concurrency Control Algorithms | 1991 | SIGMOD | 0.00011295081 |
| 12,843 | New Concurrency Control Algorithms for Accessing and Compacting B-Trees | 1994 | VLDB | 4.1945683e-05 |