{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T15:49:20Z","timestamp":1768405760885,"version":"3.49.0"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T00:00:00Z","timestamp":1685059200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["2144588"],"award-info":[{"award-number":["2144588"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2023,5,26]]},"abstract":"<jats:p>Transaction priority is a critical feature for real-world database systems. Under high contention, certain classes of transactions should be given a higher chance to commit than others. Such a prioritization mechanism is commonly implemented in locking-based concurrency control protocols as some lock scheduling mechanisms, but it is rarely supported in the world of optimistic concurrency control.<\/jats:p>\n          <jats:p>We present Polaris, an optimistic concurrency control protocol that supports multiple priority levels. To enforce priority, Polaris introduces a minimal amount of pessimism through a lightweight reservation mechanism. The protocol is fully optimistic among transactions within the same priority level and preserves the high throughput advantage of optimistic protocols. Our evaluation with YCSB workload shows that Polaris can make the p999 tail latency of high-priority transactions 13x lower than that of low-priority ones. With an abort-aware priority assignment policy, Polaris can deliver 1.9x higher throughput and 17x lower tail latency compared to Silo for high-contention workloads.<\/jats:p>","DOI":"10.1145\/3588724","type":"journal-article","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T17:42:05Z","timestamp":1685468525000},"page":"1-24","source":"Crossref","is-referenced-by-count":12,"title":["Polaris: Enabling Transaction Priority in Optimistic Concurrency Control"],"prefix":"10.1145","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1029-4175","authenticated-orcid":false,"given":"Chenhao","family":"Ye","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-8819-4901","authenticated-orcid":false,"given":"Wuh-Chwen","family":"Hwang","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8601-1416","authenticated-orcid":false,"given":"Keren","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-0785-2519","authenticated-orcid":false,"given":"Xiangyao","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,5,30]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/132271.132276"},{"key":"e_1_2_2_2_1","unstructured":"William Assaf. n.d.. SET DEADLOCK_PRIORITY (Transact-SQL) - SQL Server. https:\/\/docs.microsoft.com\/en-us\/sql\/t-sql\/statements\/set-deadlock-priority-transact-sql?view=sql-server-ver15"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517879"},{"key":"e_1_2_2_4_1","unstructured":"CockroachDB. n.d.. Transaction | CockroachDB Docs. https:\/\/www.cockroachlabs.com\/docs\/v21.2\/transactions#transaction-priorities"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_2_6_1","unstructured":"Transaction Processing Performance Council. 1992. TPC-C: an On-Line Transaction Processing Benchmark. http:\/\/www.tpc.org\/tpcc\/"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/3282495.3282502"},{"key":"e_1_2_2_9_1","volume-title":"The Design and Operation of CloudLab. In 2019 USENIX Annual Technical Conference (USENIX ATC 19)","author":"Duplyakin Dmitry","year":"2019","unstructured":"Dmitry Duplyakin, Robert Ricci, Aleksander Maricq, Gary Wong, Jonathon Duerig, Eric Eide, Leigh Stoller, Mike Hibler, David Johnson, Kirk Webb, Aditya Akella, Kuangching Wang, Glenn Ricart, Larry Landweber, Chip Elliott, Michael Zink, Emmanuel Cecchet, Snigdhaswin Kar, and Prabodh Mishra. 2019. The Design and Operation of CloudLab. In 2019 USENIX Annual Technical Conference (USENIX ATC 19). USENIX Association, Renton, WA, 1--14. https:\/\/www.usenix.org\/conference\/atc19\/presentation\/duplyakin"},{"key":"e_1_2_2_10_1","unstructured":"Zhihan Guo Kan Wu Cong Yan and Xiangyao Yu. 2021a. Bamboo codebase. https:\/\/github.com\/ScarletGuo\/Bamboo-Public"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457294"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1990.128734"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/298514.298585"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415535"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/141818.141822"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526135"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2746480"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/319566.319567"},{"key":"e_1_2_2_19_1","first-page":"28","article-title":"High-Performance Transaction Processing in SAP HANA","volume":"36","author":"Lee Juchang","year":"2013","unstructured":"Juchang Lee, Michael Muehle, Norman May, Franz Faerber, Vishal Sikka, Hasso Plattner, Jens Krueger, and Martin Grund. 2013. High-Performance Transaction Processing in SAP HANA. IEEE Data Eng. Bull., Vol. 36, 2 (2013), 28--33.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064015"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407808"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749436"},{"key":"e_1_2_2_23_1","unstructured":"Oracle. 2019. Berkeley DB C API Reference. https:\/\/docs.oracle.com\/database\/bdb181\/html\/api_reference\/CXX\/txnset_priority.html"},{"key":"e_1_2_2_24_1","unstructured":"FoundationDB project authors. 2022. Python API - FoundationDB 7.1. https:\/\/apple.github.io\/foundationdb\/api-python.html#transaction-options"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3386134"},{"key":"e_1_2_2_26_1","volume-title":"Toward Coordination-free and Reconfigurable Mixed Concurrency Control. In 2018 USENIX Annual Technical Conference (USENIX ATC 18)","author":"Tang Dixin","unstructured":"Dixin Tang and Aaron J. Elmore. 2018. Toward Coordination-free and Reconfigurable Mixed Concurrency Control. In 2018 USENIX Annual Technical Conference (USENIX ATC 18). USENIX Association, Boston, MA, 809--822. https:\/\/www.usenix.org\/conference\/atc18\/presentation\/tang"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522713"},{"key":"e_1_2_2_28_1","volume-title":"15th USENIX Symposium on Operating Systems Design and Implementation (OSDI 21)","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 (OSDI 21). USENIX Association, 198--216. https:\/\/www.usenix.org\/conference\/osdi21\/presentation\/wang-jiachen"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/3015274.3015276"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815430"},{"key":"e_1_2_2_31_1","unstructured":"Chenhao Ye Wuh-Chwen Hwang Keren Chen and Xiangyao Yu. 2022. Polaris codebase. https:\/\/github.com\/chenhao-ye\/polaris"},{"key":"e_1_2_2_32_1","unstructured":"Xiangyao Yu George Bezerra Andrew Pavlo Srinivas Devadas and Michael Stonebraker. 2014a. DBx1000 codebase. https:\/\/github.com\/yxymit\/DBx1000"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735511"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882935"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/3231751.3231763"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457559"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588724","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3588724","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3588724","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:35Z","timestamp":1750178855000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588724"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,26]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,5,26]]}},"alternative-id":["10.1145\/3588724"],"URL":"https:\/\/doi.org\/10.1145\/3588724","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,26]]}}}