OptiQL: Robust Optimistic Locking for Memory-Optimized Indexes

Summary: OptiQL extends the MCS lock with optimistic reads for memory-optimized B+-trees, delivering contention robustness while preserving a compact 8-byte lock and fairness. Evaluated on a 40-core dual-socket server, OptiQL matches read performance of existing optimistic locks and prevents collapse under high contention. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: hc24aace4e71e4458
Venue: SIGMOD
Year: 2023
Pagerank: 5.2757349e-05
Overall Rank: 8,668 | 41.90%
DOI: 10.1145/3617336

Incoming Non-self Citations Over Time

Authors

1. Ge Shi (Simon Fraser University)
2. Ziyi Yan (Simon Fraser University)
3. Tianzheng Wang (Simon Fraser University)

BibTeX Citation

@inproceedings{shi_sigmod23,
        title = {{OptiQL: Robust Optimistic Locking for Memory-Optimized Indexes}},
        author = {Shi, Ge and Yan, Ziyi and Wang, Tianzheng},
        series = {{SIGMOD} '23},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3617336},
        url = {https://dl.acm.org/doi/10.1145/3617336},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
5,965	DEX: Scalable Range Indexing on Disaggregated Memory	2024	VLDB	5.9144433e-05
9,764	Tabular: Efficiently Building Efficient Indexes	2025	VLDB	5.115551e-05
10,741	Predictive Translation: High-Performance Buffer Management Without the Trade-Offs	2026	SIGMOD	4.9605343e-05
10,821	Operation-Aware Hybrid Locking for Modern In-Memory Indexes	2026	VLDB	4.9605343e-05
11,301	FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update	2025	VLDB	4.9605343e-05

Outgoing Citations (Sorted by Pagerank)

Showing 19 of 19 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.00047937476
106	Quickly Generating Billion-Record Synthetic Databases	1994	SIGMOD	0.00033563032
427	ALEX: An Updatable Adaptive Learned Index	2020	SIGMOD	0.00018429918
504	FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory	2016	SIGMOD	0.00017195543
542	FOEDUS: OLTP Engine for a Thousand Cores and NVRAM	2015	SIGMOD	0.00016620527
636	ERMIA: Fast Memory-Optimized Database System for Heterogeneous Workloads	2016	SIGMOD	0.00015329098
773	Cicada: Dependably Fast Multi-Core In-Memory Transactions	2017	SIGMOD	0.00014075557
906	HOT: A Height Optimized Trie Index for Main-Memory Database Systems	2018	SIGMOD	0.00013129817
967	BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory	2018	VLDB	0.00012766144
1,158	Mostly-Optimistic Concurrency Control for Highly Contended Dynamic Workloads on a Thousand Cores	2017	VLDB	0.00011744154
1,328	Building a Bw-Tree Takes More Than Just Buzz Words	2018	SIGMOD	0.00011013165
1,366	Dash: Scalable Hashing on Persistent Memory	2020	VLDB	0.00010879316
1,724	Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems	2001	VLDB	9.7779713e-05
2,755	Evaluating Persistent Memory Range Indexes	2020	VLDB	8.0383029e-05
2,870	APEX: A High-Performance Learned Index on Persistent Memory	2022	VLDB	7.9033232e-05
3,309	To Lock, Swap, or Elide: On the Interplay of Hardware Transactional Memory and Lock-Free Indexing	2015	VLDB	7.4176874e-05
4,387	Latch-free Synchronization in Database Systems: Silver Bullet or Fool's Gold?	2017	CIDR	6.6129973e-05
5,509	Plush: A Write-Optimized Persistent Log-Structured Hash-Table	2022	VLDB	6.0872396e-05
6,543	Contention and Space Management in B-Trees	2021	CIDR	5.733215e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	11,301	FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update	2025	VLDB
2	1,158	Mostly-Optimistic Concurrency Control for Highly Contended Dynamic Workloads on a Thousand Cores	2017	VLDB
3	8,806	QPPT: Query Processing on Prefix Trees	2013	CIDR
4	3,981	On Being Optimistic about Real-Time Constraints	1990	PODS
5	2,071	Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks	1995	SIGMOD
6	1,437	Lightweight Locking for Main Memory Database Systems	2013	VLDB
7	4,326	Experimental Evaluation of Real-Time Optimistic Concurrency Control Schemes	1991	VLDB
8	1,724	Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems	2001	VLDB
9	6,013	Concurrency Control for Adaptive Indexing	2012	VLDB
10	10,821	Operation-Aware Hybrid Locking for Modern In-Memory Indexes	2026	VLDB