To Lock, Swap, or Elide: On the Interplay of Hardware Transactional Memory and Lock-Free Indexing

Summary: Empirical HTM vs lock-free indexing for in-memory B-trees; HTM helps only for simple, fixed keys, not complex workloads. Lock-free designs excel under contention; HTM can simplify multi-threading via multi-word CAS with 10–15% throughput loss, on Bw-tree and a memory-optimized B-tree. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 11008
Venue: VLDB
Year: 2015
Pagerank: 6.7250243e-05
Overall Rank: 3,826 | 73.39%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,087	HOT: A Height Optimized Trie Index for Main-Memory Database Systems	2018	SIGMOD	0.00014162909
1,405	BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory	2018	VLDB	0.00012174592
1,507	BatchDB: Efficient Isolated Execution of Hybrid OLTP+OLAP Workloads for Interactive Applications	2017	SIGMOD	0.00011617967
1,692	Mostly-Optimistic Concurrency Control for Highly Contended Dynamic Workloads on a Thousand Cores	2017	VLDB	0.00010901611
2,394	Building a Bw-Tree Takes More Than Just Buzz Words	2018	SIGMOD	8.9001843e-05
4,998	Latch-free Synchronization in Database Systems: Silver Bullet or Fool's Gold?	2017	CIDR	5.7757413e-05
5,748	MxTasks: How to Make Efficient Synchronization and Prefetching Easy	2021	SIGMOD	5.341943e-05
9,454	OptiQL: Robust Optimistic Locking for Memory-Optimized Indexes	2023	SIGMOD	4.3391522e-05
10,583	Tabular: Efficiently Building Efficient Indexes	2025	VLDB	4.1945683e-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

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
87	Hekaton: SQL Server’s Memory-Optimized OLTP Engine	2013	SIGMOD	0.00052389723
145	Quickly Generating Billion-Record Synthetic Databases	1994	SIGMOD	0.0004138408
215	OLTP Through the Looking Glass, and What We Found There	2008	SIGMOD	0.0003354907
1,457	High Performance Transactions in Deuteronomy	2015	CIDR	0.00011897016
1,603	PLP: Page Latch-free Shared-everything OLTP	2011	VLDB	0.00011196902
2,006	PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors	2011	VLDB	9.8101551e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
1,573	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD	0.00011295081
233	A Study of Index Structures for Main Memory Database Management Systems	1986	VLDB	0.00032021526
12,843	New Concurrency Control Algorithms for Accessing and Compacting B-Trees	1994	VLDB	4.1945683e-05
10,562	FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update	2025	VLDB	4.1945683e-05
5,239	A Framework for the Performance Analysis of Concurrent B-tree Algorithms	1990	PODS	5.6106291e-05
2,244	Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems	2001	VLDB	9.2097912e-05
12,810	Index Concurrency Control in Firm Real-Time DBMS	1995	VLDB	4.1945683e-05
4,386	Indexing on Modern Hardware: Hekaton and Beyond	2014	SIGMOD	6.2320098e-05
1,405	BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory	2018	VLDB	0.00012174592
2,394	Building a Bw-Tree Takes More Than Just Buzz Words	2018	SIGMOD	8.9001843e-05