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)

Paper ID: h7d562e24407e1359
Venue: CIDR
Year: 2021
Pagerank: 5.7549598e-05
Overall Rank: 6,530 | 56.10%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Adnan Alhomssi (Friedrich Schiller University of Jena)
2. Viktor Leis (Friedrich Schiller University of Jena)

BibTeX Citation

@inproceedings{alhomssi_cidr21,
        address = {Amsterdam, Netherlands},
        series = {{CIDR} '21},
        title = {{Contention and Space Management in B-Trees}},
        booktitle = {Proceedings of the {Conference} on {Innovative} {Data} {Systems} {Research}},
        author = {Alhomssi, Adnan and Leis, Viktor},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
5,360	LeanStore: A High-Performance Storage Engine for NVMe SSDs	2024	VLDB	6.1614422e-05
6,270	Is Scalable OLTP in the Cloud a Solved Problem? Analyzing Data Access for Distributed OLTP Architectures	2023	CIDR	5.8283805e-05
7,154	Adaptive Hybrid Indexes	2022	SIGMOD	5.597934e-05
7,735	Scalable and Robust Snapshot Isolation for High-Performance Storage Engines	2023	VLDB	5.4631389e-05
8,642	OptiQL: Robust Optimistic Locking for Memory-Optimized Indexes	2023	SIGMOD	5.2957446e-05
9,998	B-Trees Are Back: Engineering Fast and Pageable Node Layouts	2025	SIGMOD	5.0979044e-05
10,366	Bounding the Fragmentation of B-Trees Subject to Batched Insertions	2026	PODS	4.9793485e-05
10,669	Predictive Translation: High-Performance Buffer Management Without the Trade-Offs	2026	SIGMOD	4.9793485e-05
10,725	How to Write to SSDs	2026	VLDB	4.9793485e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
35	Hekaton: SQL Server’s Memory-Optimized OLTP Engine	2013	SIGMOD	0.00048001919
373	Umbra: A Disk-Based System with In-Memory Performance	2020	CIDR	0.00019711632
1,539	Sorting And Indexing With Partitioned B-Trees	2003	CIDR	0.00010316015
2,791	Utilization of B-trees with Inserts, Deletes and Modifies	1989	PODS	8.009544e-05
2,877	Exploiting Directly-Attached NVMe Arrays in DBMS	2020	CIDR	7.9181223e-05
3,047	Handling Highly Contended OLTP Workloads Using Fast Dynamic Partitioning	2020	SIGMOD	7.7124257e-05
3,898	Analyzing the Impact of System Architecture on the Scalability of OLTP Engines for High-Contention Workloads	2018	VLDB	6.936402e-05
4,362	Latch-free Synchronization in Database Systems: Silver Bullet or Fool's Gold?	2017	CIDR	6.6380763e-05
4,848	Rethinking Logging, Checkpoints, and Recovery for High-Performance Storage Engines	2020	SIGMOD	6.3818116e-05
5,906	HydraList: A Scalable In-Memory Index Using Asynchronous Updates and Partial Replication	2020	VLDB	5.9508926e-05
6,317	Robust Performance of Main Memory Data Structures by Configuration	2020	SIGMOD	5.8154421e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	6,376	Compact B-Trees	1979	SIGMOD
2	7,325	BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees	2023	VLDB
3	7,958	Online B-Tree Merging	2005	SIGMOD
4	5,661	A Framework for the Performance Analysis of Concurrent B-tree Algorithms	1990	PODS
5	9,699	Revisiting B-tree Compression: An Experimental Study	2024	SIGMOD
6	11,555	Breathing New Life into An Old Tree: Resolving Logging Dilemma of B+-tree on Modern Computational Storage Drives	2024	VLDB
7	9,998	B-Trees Are Back: Engineering Fast and Pageable Node Layouts	2025	SIGMOD
8	10,366	Bounding the Fragmentation of B-Trees Subject to Batched Insertions	2026	PODS
9	1,692	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD
10	13,326	New Concurrency Control Algorithms for Accessing and Compacting B-Trees	1994	VLDB