{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T14:55:16Z","timestamp":1771685716466,"version":"3.50.1"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>Optimistic concurrency control (OCC) protocols validate whether a transaction has conflicts with other concurrent transactions after this transaction completes its execution. In this work, we demonstrate that the validation phase has a great influence on the performance of modern in-memory database systems, especially under heterogeneous workloads. The cost of validating operations in a transaction is determined by two main factors. The first factor is the operation type. An OCC protocol would take much less cost on validating a single-record read operation than validating a key-range scan operation. The second factor is the workload type. Existing schemes in OCC variants for validating key-range scan perform differently under various workloads.<\/jats:p>\n          <jats:p>Although various validation schemes share the same goal of guaranteeing a transaction schedule to be serializable, there are remarkable differences between the costs they introduced. These observations motivate us to design an optimistic concurrency control which can choose a low-cost validation scheme at runtime, referred to as adaptive optimistic concurrency control (AOCC). First, at transaction-level granularity, AOCC can assign a validation method to a transaction according to the features of its operations. Furthermore, for each operation in a transaction, the validation method is selected according to not only the number of accessed records but also the instant characteristics of workloads. Experimental results show that AOCC has good performance and scalability under heterogeneous workloads mixed with point accesses and predicate queries.<\/jats:p>","DOI":"10.14778\/3303753.3303763","type":"journal-article","created":{"date-parts":[[2019,2,27]],"date-time":"2019-02-27T14:57:56Z","timestamp":1551279476000},"page":"584-596","source":"Crossref","is-referenced-by-count":17,"title":["Adaptive optimistic concurrency control for heterogeneous workloads"],"prefix":"10.14778","volume":"12","author":[{"given":"Jinwei","family":"Guo","sequence":"first","affiliation":[{"name":"East China Normal University"}]},{"given":"Peng","family":"Cai","sequence":"additional","affiliation":[{"name":"East China Normal University and Guilin University of Electronic Technology"}]},{"given":"Jiahao","family":"Wang","sequence":"additional","affiliation":[{"name":"East China Normal University"}]},{"given":"Weining","family":"Qian","sequence":"additional","affiliation":[{"name":"East China Normal University"}]},{"given":"Aoying","family":"Zhou","sequence":"additional","affiliation":[{"name":"East China Normal University"}]}],"member":"320","published-online":{"date-parts":[[2019,1]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"DBx1000. https:\/\/github.com\/yxymit\/DBx1000.  DBx1000. https:\/\/github.com\/yxymit\/DBx1000."},{"key":"e_1_2_1_2_1","volume-title":"https:\/\/www.gartner.com\/doc\/3599217\/market-guide-htapenabling-inmemory-computing","year":"2017","unstructured":"Market Guide for HTAP-Enabling In-Memory Computing Technologies. https:\/\/www.gartner.com\/doc\/3599217\/market-guide-htapenabling-inmemory-computing , 2017 . Market Guide for HTAP-Enabling In-Memory Computing Technologies. https:\/\/www.gartner.com\/doc\/3599217\/market-guide-htapenabling-inmemory-computing, 2017."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851143"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463710"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/582318.582340"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767867"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882905"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/319566.319567"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2095686.2095689"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064015"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00154"},{"key":"e_1_2_1_13_1","volume-title":"PostgreSQL: Introduction and Concepts","author":"Momjian B.","year":"2001","unstructured":"B. Momjian . PostgreSQL: Introduction and Concepts . Addison-Wesley Longman Publishing Co., Inc. , Boston, MA, USA , 2001 . B. Momjian. PostgreSQL: Introduction and Concepts. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2001."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749436"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3054784"},{"key":"e_1_2_1_16_1","first-page":"81","volume-title":"VLDB","author":"Reimer M.","year":"1983","unstructured":"M. Reimer . Solving the phantom problem by predicative optimistic concurrency control . In VLDB , pages 81 -- 88 . Morgan Kaufmann , 1983 . M. Reimer. Solving the phantom problem by predicative optimistic concurrency control. In VLDB, pages 81--88. Morgan Kaufmann, 1983."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0377-7"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213946"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064031"},{"key":"e_1_2_1_20_1","first-page":"809","volume-title":"USENIX Annual Technical Conference","author":"Tang D.","year":"2018","unstructured":"D. Tang and A. J. Elmore . Toward coordination-free and reconfigurable mixed concurrency control . In USENIX Annual Technical Conference , pages 809 -- 822 , 2018 . D. Tang and A. J. Elmore. Toward coordination-free and reconfigurable mixed concurrency control. In USENIX Annual Technical Conference, pages 809--822, 2018."},{"key":"e_1_2_1_21_1","volume-title":"CIDR","author":"Tang D.","year":"2017","unstructured":"D. Tang , H. Jiang , and A. J. Elmore . Adaptive concurrency control: Despite the looking glass, one concurrency control does not fit all . In CIDR , 2017 . D. Tang, H. Jiang, and A. J. Elmore. Adaptive concurrency control: Despite the looking glass, one concurrency control does not fit all. In CIDR, 2017."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522713"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3015274.3015276"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915202"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815430"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735511"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882935"},{"key":"e_1_2_1_28_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\/3303753.3303763","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:28:51Z","timestamp":1672219731000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3303753.3303763"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.14778\/3303753.3303763"],"URL":"https:\/\/doi.org\/10.14778\/3303753.3303763","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}