Rebirth-Retire: A Concurrency Control Protocol Adaptable to Different Levels of Contention
Qian Zhang, Yiwen Xiang, Jianhao Wei, Yang Yang, Yifan Li, Xueqing Gong, Wanggen Liu
Abstract
The Wound-Retire concurrency control protocol was proposed to reduce contention for hotspots in in-memory databases. It enhances throughput under high-contention scenarios by allowing transactions to release their locks earlier (referred to as Retire ), thereby reducing the wait times for other transactions. However, the proactive early release of locks introduces additional overhead, making it less efficient than other lock-based protocols in low-contention scenarios. Moreover, the wound strategy it adopts, while effective at preventing deadlocks, may lead to unnecessary transaction aborts.
To address these issues, this paper proposes the Rebirth-Retire concurrency control protocol as an enhancement to the Wound-Retire protocol. In this protocol, a lock is retired by a younger transaction that requests it, which reduces unnecessary retire costs in low-contention scenarios. Additionally, rather than aborting younger transactions, older transactions are assigned larger times-tamps (referred to as Rebirth ), unless doing so would result in a deadlock. Experimental evaluations demonstrate that the Rebirth-Retire protocol achieves better throughput and lower abort rate than the Wound-Retire protocol across varying levels of contention workloads.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 12bddd44-3957-4cd4-b9b0-a08e22abe327Cited by top-tier papers1
Ask how each one uses itBuilds on12
- Releasing Locks As Early As You Can: Reducing Contention of Hotspots by Violating Two-Phase LockingZhihan Guo, Kan Wu, Cong Yan, Xiangyao YuSIGMOD 2021 · 44 citations
- Polyjuice: High-Performance Transactions via Learned Concurrency ControlJia-Chen Wang, Ding Ding, Huan Wang, Conrad Christensen et al.OSDI 2021 · 39 citations
- Plor: General Transactions with Predictable, Low Tail LatencyYoumin Chen, Xiangyao Yu, Paraschos Koutris, Andrea C. Arpaci-Dusseau et al.SIGMOD 2022 · 25 citations
- Unifying Timestamp with Transaction Ordering for MVCC with Decentralized Scalar TimestampXingda Wei, Rong Chen, Haibo Chen, Zhaoguo Wang et al.NSDI 2021 · 24 citations
- The Art of Latency Hiding in Modern Database EnginesKaisong Huang, Tianzheng Wang, Qingqing Zhou, Qingzhong MengVLDB 2024 · 23 citations
Related papers
- Brook-2PL: Tolerating High Contention Workloads with A Deadlock-Free Two-Phase Locking ProtocolFarzad Habibi, Juncheng Fang, Tania Lorido-Botran, Faisal NawabSIGMOD 2026 · 1 citation
- Morty: Scaling Concurrency Control with Re-ExecutionMatthew Burke, Florian Suri-Payer, Jeffrey Helt, Lorenzo Alvisi et al.EuroSys 2023 · 7 citations
- Polaris: Enabling Transaction Priority in Optimistic Concurrency ControlChenhao Ye, Wuh-Chwen Hwang, Keren Chen, Xiangyao YuSIGMOD 2023 · 12 citations
- C5: Cloned Concurrency Control That Always Keeps UpJeffrey Helt, Abhinav Sharma, Daniel J. Abadi, Wyatt Lloyd et al.VLDB 2023 · 17 citations
- Avoiding Read Stalls on Flash StorageMijin An, In-Yeong Song, Yong Ho Song, Sang-Won LeeSIGMOD 2022 · 10 citations
