{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T17:56:43Z","timestamp":1757613403608,"version":"3.44.0"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"9","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2025,5]]},"abstract":"<jats:p>\n            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\n            <jats:italic toggle=\"yes\">Retire<\/jats:italic>\n            ), 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.\n          <\/jats:p>\n          <jats:p>\n            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\n            <jats:italic toggle=\"yes\">Rebirth<\/jats:italic>\n            ), 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.\n          <\/jats:p>","DOI":"10.14778\/3746405.3746435","type":"journal-article","created":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T17:06:20Z","timestamp":1756919180000},"page":"3162-3174","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Rebirth-Retire: A Concurrency Control Protocol Adaptable to Different Levels of Contention"],"prefix":"10.14778","volume":"18","author":[{"given":"Qian","family":"Zhang","sequence":"first","affiliation":[{"name":"East China Normal University, Shanghai, China"}]},{"given":"Yiwen","family":"Xiang","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}]},{"given":"Jianhao","family":"Wei","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}]},{"given":"Yang","family":"Yang","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}]},{"given":"Yifan","family":"Li","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}]},{"given":"Xueqing","family":"Gong","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}]},{"given":"Wanggen","family":"Liu","sequence":"additional","affiliation":[{"name":"Transwarp Technology (Shanghai) Co., Ltd, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2025,9,3]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2020. DBx1000. https:\/\/github.com\/yxymit\/DBx1000."},{"key":"e_1_2_1_2_1","unstructured":"Sam Ainsworth. 2018. Prefetching for complex memory access patterns. Technical Report. University of Cambridge Computer Laboratory."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD.2018.00041"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915231"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/356842.356846"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"P. A. Bernstein and E. Newcomer. 2009. Principles of Transaction Processing. Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-623-4.00002-0"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234182"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3552326.3567500"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588706"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS57955.2024.00067"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517879"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/3681954.3681956"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3636218.363624"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"volume-title":"Technical Report","author":"Transaction Processing Council","key":"e_1_2_1_15_1","unstructured":"Transaction Processing Council. 2007. TPC-C Benchmark (Revision 5.9.0). Technical Report. Transaction Processing Council. Available at: https:\/\/www.tpc.org\/tpcc\/."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463710"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3594512.3594523"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/360363.360369"},{"volume-title":"Proceedings of the Berkeley Workshop","author":"Gray J.","key":"e_1_2_1_19_1","unstructured":"J. Gray, P. Homan, H. Korth, and R. Obermarck. 1981. A Straw Man Analysis of the Probability of Waiting and Deadlock in a Database System. In Proceedings of the Berkeley Workshop. Berkeley, CA."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/573304"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/191843.191886"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457294"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3632093.3632117"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807233"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/368996.369025"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882905"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/319566.319567"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2095686.2095689"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00026"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933349.2933352"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3641204.3641210"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3302424.3303966"},{"key":"e_1_2_1_33_1","volume-title":"2018 USENIX Annual Technical Conference. 809\u2013822","author":"Tang Dixin","year":"2018","unstructured":"Dixin Tang and Aaron J Elmore. 2018. Toward coordination-free and reconfigurable mixed concurrency control. In 2018 USENIX Annual Technical Conference. 809\u2013822."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522713"},{"key":"e_1_2_1_35_1","volume-title":"15th USENIX Symposium on Operating Systems Design and Implementation. 198\u2013216","author":"Wang Jiachen","year":"2021","unstructured":"Jiachen Wang, Ding Ding, Huan Wang, Conrad Christensen, Zhaoguo Wang, Haibo Chen, and Jinyang Li. 2021. Polyjuice:High-Performance transactions via learned concurrency control. In 15th USENIX Symposium on Operating Systems Design and Implementation. 198\u2013216."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3015274.3015276"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882934"},{"key":"e_1_2_1_38_1","unstructured":"Jack Waudby. 2024. High Performance Concurrency Control and Commit Protocols in OLTP Databases. Ph.D. Dissertation. Newcastle University."},{"key":"e_1_2_1_39_1","volume-title":"Unifying Timestamp with Transaction Ordering for MVCC with Decentralized Scalar Timestamp. In 18th USENIX Symposium on Networked Systems Design and Implementation. 357\u2013372","author":"Wei Xingda","year":"2021","unstructured":"Xingda Wei, Rong Chen, Haibo Chen, Zhaoguo Wang, Zhenhan Gong, and Binyu Zang. 2021. Unifying Timestamp with Transaction Ordering for MVCC with Decentralized Scalar Timestamp. In 18th USENIX Symposium on Networked Systems Design and Implementation. 357\u2013372."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815430"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588724"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735511"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882935"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904121.2904126"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3746405.3746435","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T19:52:14Z","timestamp":1757015534000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3746405.3746435"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":44,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["10.14778\/3746405.3746435"],"URL":"https:\/\/doi.org\/10.14778\/3746405.3746435","relation":{},"ISSN":["2150-8097"],"issn-type":[{"type":"print","value":"2150-8097"}],"subject":[],"published":{"date-parts":[[2025,5]]},"assertion":[{"value":"2025-09-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}