{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T03:05:47Z","timestamp":1784775947643,"version":"3.55.0"},"reference-count":68,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T00:00:00Z","timestamp":1764892800000},"content-version":"vor","delay-in-days":1,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["2321121, CNS1815212, SaTC-2245372"],"award-info":[{"award-number":["2321121, CNS1815212, SaTC-2245372"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Roblox","award":["Gift"],"award-info":[{"award-number":["Gift"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,12,4]]},"abstract":"<jats:p>\n                    The problem of hotspots remains a critical challenge in high-contention workloads for concurrency control (CC) protocols. Traditional concurrency control approaches encounter significant difficulties under high contention, resulting in excessive transaction aborts and deadlocks. In this paper, we propose\n                    <jats:italic toggle=\"yes\">Brook-2PL<\/jats:italic>\n                    , a novel two-phase locking (2PL) protocol that (1) introduces\n                    <jats:italic toggle=\"yes\">SLW-Graph<\/jats:italic>\n                    for deadlock-free transaction execution, and (2) proposes\n                    <jats:italic toggle=\"yes\">partial transaction chopping<\/jats:italic>\n                    for early lock release. Previous methods suffer from transaction aborts that lead to wasted work and can further burden the system due to their cascading effects. Brook-2PL addresses this limitation by statically analyzing a new graph-based dependency structure called\n                    <jats:italic toggle=\"yes\">SLW-Graph<\/jats:italic>\n                    , enabling deadlock-free two-phase locking through predetermined lock acquisition.\n                    <jats:italic toggle=\"yes\">Brook-2PL<\/jats:italic>\n                    also reduces contention by enabling early lock release using partial transaction chopping and static transaction analysis. We overcome the inherent limitations of traditional transaction chopping by providing a more flexible chopping method. Evaluation using both our synthetic online game store workload and the TPC-C benchmark shows that\n                    <jats:italic toggle=\"yes\">Brook-2PL<\/jats:italic>\n                    significantly outperforms state-of-the-art CC protocols.\n                    <jats:italic toggle=\"yes\">Brook-2PL<\/jats:italic>\n                    achieves an average speed-up of (2.86x) while reducing tail latency (p95) by (48%) in the TPC-C benchmark.\n                  <\/jats:p>","DOI":"10.1145\/3769767","type":"journal-article","created":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:32:13Z","timestamp":1764995533000},"page":"1-27","source":"Crossref","is-referenced-by-count":1,"title":["Brook-2PL: Tolerating High Contention Workloads with A Deadlock-Free Two-Phase Locking Protocol"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3180-5173","authenticated-orcid":false,"given":"Farzad","family":"Habibi","sequence":"first","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6901-8235","authenticated-orcid":false,"given":"Juncheng","family":"Fang","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9132-4435","authenticated-orcid":false,"given":"Tania","family":"Lorido-Botran","sequence":"additional","affiliation":[{"name":"Roblox, San Jose, USA and Northeastern University, Boston, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2264-4600","authenticated-orcid":false,"given":"Faisal","family":"Nawab","sequence":"additional","affiliation":[{"name":"University of California, Irvine, Irvine, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,12,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01232473"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3149193.3149194"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735509"},{"key":"e_1_2_1_4_1","first-page":"223","volume-title":"CIDR","volume":"11","author":"Baker Jason","year":"2011","unstructured":"Jason Baker, Chris Bond, James C Corbett, JJ Furman, Andrey Khorlin, James Larson, Jean-Michel Leon, Yawei Li, Alexander Lloyd, and Vadim Yushprakh. 2011. Megastore: Providing scalable, highly available storage for interactive services.. In CIDR, Vol. 11. 223-234."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/319996.319998"},{"key":"e_1_2_1_6_1","unstructured":"Philip A Bernstein Vassos Hadzilacos Nathan Goodman et al. 1987. Concurrency control and recovery in database systems. Vol. 370. Addison-wesley Reading."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3458336.3465286"},{"key":"e_1_2_1_8_1","first-page":"49","volume-title":"2013 USENIX Annual Technical Conference (USENIX ATC 13)","author":"Bronson Nathan","year":"2013","unstructured":"Nathan Bronson, Zach Amsden, George Cabrera, Prasad Chakka, Peter Dimov, Hui Ding, Jack Ferris, Anthony Giardullo, Sachin Kulkarni, Harry Li, et al., 2013. {TAO}:{Facebook's} distributed data store for the social graph. In 2013 USENIX Annual Technical Conference (USENIX ATC 13). 49-60."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/Blockchain55522.2022.00049"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3552326.3567500"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/3681954.3681956"},{"key":"e_1_2_1_13_1","first-page":"223","volume-title":"2012 USENIX Annual Technical Conference (USENIX ATC 12)","author":"Cowling James","year":"2012","unstructured":"James Cowling and Barbara Liskov. 2012. Granola:{Low-Overhead} distributed transaction coordination. In 2012 USENIX Annual Technical Conference (USENIX ATC 12). 223-235."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463710"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3282495.3282502"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3282495.3282502"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3594512.3594523"},{"key":"e_1_2_1_18_1","volume-title":"Transactions for Distributed Actors in the Cloud. Transactions for Distributed Actors in the Cloud","author":"Eldeeb Tamer","year":"2016","unstructured":"Tamer Eldeeb and Philip A Bernstein. 2016. Transactions for Distributed Actors in the Cloud. Transactions for Distributed Actors in the Cloud (2016)."},{"key":"e_1_2_1_19_1","volume-title":"Rethinking serializable multiversion concurrency control. arXiv preprint arXiv:1412.2324","author":"Faleiro Jose M","year":"2014","unstructured":"Jose M Faleiro and Daniel J Abadi. 2014. Rethinking serializable multiversion concurrency control. arXiv preprint arXiv:1412.2324 (2014)."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055540.3055553"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/Blockchain55522.2022.00045"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465325"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457294"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253366"},{"key":"e_1_2_1_25_1","volume-title":"PhD Forum: Towards Metastable-Failure-Free Distributed Transaction Systems. In 2024 43rd International Symposium on Reliable Distributed Systems (SRDS). IEEE, 318-321","author":"Habibi Farzad","year":"2024","unstructured":"Farzad Habibi. 2024. PhD Forum: Towards Metastable-Failure-Free Distributed Transaction Systems. In 2024 43rd International Symposium on Reliable Distributed Systems (SRDS). IEEE, 318-321."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS64841.2024.00013"},{"key":"e_1_2_1_27_1","first-page":"73","volume-title":"Metastable Failures in the Wild. In 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22)","author":"Huang Lexiang","year":"2022","unstructured":"Lexiang Huang, Matthew Magnusson, Abishek Bangalore Muralikrishna, Salman Estyak, Rebecca Isaacs, Abutalib Aghayev, Timothy Zhu, and Aleksey Charapko. 2022. Metastable Failures in the Wild. In 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22). 73-90."},{"key":"e_1_2_1_28_1","unstructured":"Dean Jacobs and Stefan Aulbach. 2007. Ruminations on multi-tenant databases. (2007)."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807233"},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the 2020 USENIX Annual Technical Conference (USENIX ATC '20). USENIX Association.","author":"Keahey Kate","year":"2020","unstructured":"Kate Keahey, Jason Anderson, Zhuo Zhen, Pierre Riteau, Paul Ruth, Dan Stanzione, Mert Cevik, Jacob Colleran, Haryadi S. Gunawi, Cody Hammock, Joe Mambretti, Alexander Barnes, Fran\u00e7ois Halbach, Alex Rocha, and Joe Stubbs. 2020. Lessons Learned from the Chameleon Testbed. In Proceedings of the 2020 USENIX Annual Technical Conference (USENIX ATC '20). USENIX Association."},{"key":"e_1_2_1_31_1","first-page":"1376616","article-title":"HBase and Hypertable for large scale distributed storage systems. Dept. of Computer Science","volume":"10","author":"Khetrapal Ankur","year":"2006","unstructured":"Ankur Khetrapal and Vinay Ganesh. 2006. HBase and Hypertable for large scale distributed storage systems. Dept. of Computer Science, Purdue University, Vol. 10, 1376616.1376726 (2006).","journal-title":"Purdue University"},{"key":"e_1_2_1_32_1","first-page":"1","article-title":"Efficient locking techniques for databases on modern hardware.. In ADMS@ VLDB","author":"Kimura Hideaki","year":"2012","unstructured":"Hideaki Kimura, Goetz Graefe, and Harumi A Kuno. 2012. Efficient locking techniques for databases on modern hardware.. In ADMS@ VLDB. Citeseer, 1-12.","journal-title":"Citeseer"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/319566.319567"},{"key":"e_1_2_1_34_1","volume-title":"Cassandra: a decentralized structured storage system. ACM SIGOPS operating systems review","author":"Lakshman Avinash","year":"2010","unstructured":"Avinash Lakshman and Prashant Malik. 2010. Cassandra: a decentralized structured storage system. ACM SIGOPS operating systems review, Vol. 44, 2 (2010), 35-40."},{"key":"e_1_2_1_35_1","volume-title":"High-performance concurrency control mechanisms for main-memory databases. arXiv preprint arXiv:1201.0228","author":"Larson Per-\u00c5ke","year":"2011","unstructured":"Per-\u00c5ke Larson, Spyros Blanas, Cristian Diaconu, Craig Freedman, Jignesh M Patel, and Mike Zwilling. 2011. High-performance concurrency control mechanisms for main-memory databases. arXiv preprint arXiv:1201.0228 (2011)."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2831360.2831368"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064015"},{"key":"e_1_2_1_38_1","first-page":"333","volume-title":"14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20)","author":"Lu Haonan","year":"2020","unstructured":"Haonan Lu, Siddhartha Sen, and Wyatt Lloyd. 2020a. {Performance-Optimal}{Read-Only} Transactions. In 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20). 333-349."},{"key":"e_1_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Yi Lu Xiangyao Yu Lei Cao and Samuel Madden. 2020b. Aria: a fast and practical deterministic OLTP database. (2020).","DOI":"10.14778\/3407790.3407808"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732270"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/2685048.2685086"},{"key":"e_1_2_1_42_1","first-page":"511","volume-title":"11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14)","author":"Narula Neha","year":"2014","unstructured":"Neha Narula, Cody Cutler, Eddie Kohler, and Robert Morris. 2014. Phase Reconciliation for Contended {In-Memory} Transactions. In 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14). 511-524."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3725268"},{"key":"e_1_2_1_44_1","volume-title":"https:\/\/docs.oracle.com\/en\/java\/javase\/11\/docs\/api\/java.base\/java\/util\/concurrent\/ConcurrentHashMap.html. Accessed","author":"HashMap","year":"2025","unstructured":"Oracle. [n.d.]. ConcurrentHashMap (Java SE 11 and JDK 11). https:\/\/docs.oracle.com\/en\/java\/javase\/11\/docs\/api\/java.base\/java\/util\/concurrent\/ConcurrentHashMap.html. Accessed April 4, 2025."},{"key":"e_1_2_1_45_1","volume-title":"Yuncheng Wu, Yeow Meng Chee, Gang Chen, and Beng Chin Ooi.","author":"Pan Hexiang","year":"2025","unstructured":"Hexiang Pan, Shaofeng Cai, Tien Tuan Anh Dinh, Yuncheng Wu, Yeow Meng Chee, Gang Chen, and Beng Chin Ooi. 2025. CCaaLF: Concurrency Control as a Learnable Function. arXiv preprint arXiv:2503.10036 (2025)."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389764"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274808.3274810"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477132.3483591"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.1269595"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882958"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/320251.320260"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733006"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915238"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/211414.211427"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/3424573.3424575"},{"key":"e_1_2_1_56_1","first-page":"1","article-title":"Adaptive Concurrency Control: Despite the Looking Glass, One Concurrency Control Does Not Fit All","volume":"2","author":"Tang Dixin","year":"2017","unstructured":"Dixin Tang, Hao Jiang, and Aaron J Elmore. 2017. Adaptive Concurrency Control: Despite the Looking Glass, One Concurrency Control Does Not Fit All.. In CIDR, Vol. 2. 1.","journal-title":"CIDR"},{"key":"e_1_2_1_57_1","unstructured":"The Transaction Processing Council. 2007. TPC-C Benchmark (Revision 5.9.0)."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.667102"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213838"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522713"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.14778\/3015274.3015276"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882934"},{"key":"e_1_2_1_63_1","first-page":"495","volume-title":"11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14)","author":"Xie Chao","year":"2014","unstructured":"Chao Xie, Chunzhi Su, Manos Kapritsos, Yang Wang, Navid Yaghmazadeh, Lorenzo Alvisi, and Prince Mahajan. 2014. Salt: Combining {ACID} and {BASE} in a distributed database. In 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14). 495-509."},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.121754"},{"key":"e_1_2_1_65_1","unstructured":"Xiangyao Yu George Bezerra Andrew Pavlo Srinivas Devadas and Michael Stonebraker. 2014. Staring into the abyss: An evaluation of concurrency control with one thousand cores. (2014)."},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904121.2904126"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522729"},{"key":"e_1_2_1_68_1","first-page":"465","volume-title":"11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14)","author":"Zheng Wenting","year":"2014","unstructured":"Wenting Zheng, Stephen Tu, Eddie Kohler, and Barbara Liskov. 2014. Fast databases with fast durability and recovery through multicore parallelism. In 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14). 465-477."}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3769767","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3769767","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T04:42:55Z","timestamp":1781325775000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3769767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,4]]},"references-count":68,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12,4]]}},"alternative-id":["10.1145\/3769767"],"URL":"https:\/\/doi.org\/10.1145\/3769767","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,4]]}}}