{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T10:21:03Z","timestamp":1783938063701,"version":"3.55.0"},"reference-count":49,"publisher":"Association for Computing Machinery (ACM)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2017,3]]},"abstract":"<jats:p>Multi-version concurrency control (MVCC) is currently the most popular transaction management scheme in modern database management systems (DBMSs). Although MVCC was discovered in the late 1970s, it is used in almost every major relational DBMS released in the last decade. Maintaining multiple versions of data potentially increases parallelism without sacrificing serializability when processing transactions. But scaling MVCC in a multi-core and in-memory setting is non-trivial: when there are a large number of threads running in parallel, the synchronization overhead can outweigh the benefits of multi-versioning.<\/jats:p>\n          <jats:p>To understand how MVCC perform when processing transactions in modern hardware settings, we conduct an extensive study of the scheme's four key design decisions: concurrency control protocol, version storage, garbage collection, and index management. We implemented state-of-the-art variants of all of these in an in-memory DBMS and evaluated them using OLTP workloads. Our analysis identifies the fundamental bottlenecks of each design choice.<\/jats:p>","DOI":"10.14778\/3067421.3067427","type":"journal-article","created":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T12:17:14Z","timestamp":1494591434000},"page":"781-792","source":"Crossref","is-referenced-by-count":144,"title":["An empirical evaluation of in-memory multi-version concurrency control"],"prefix":"10.14778","volume":"10","author":[{"given":"Yingjun","family":"Wu","sequence":"first","affiliation":[{"name":"National University of Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joy","family":"Arulraj","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiexi","family":"Lin","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ran","family":"Xian","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"Pavlo","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,3]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"MemSQL. http:\/\/www.memsql.com.  MemSQL. http:\/\/www.memsql.com."},{"key":"e_1_2_1_2_1","unstructured":"MySQL. http:\/\/www.mysql.com.  MySQL. http:\/\/www.mysql.com."},{"key":"e_1_2_1_3_1","unstructured":"NuoDB. http:\/\/www.nuodb.com.  NuoDB. http:\/\/www.nuodb.com."},{"key":"e_1_2_1_4_1","unstructured":"Oracle Timeline. http:\/\/oracle.com.edgesuite.net\/timeline\/oracle\/.  Oracle Timeline. http:\/\/oracle.com.edgesuite.net\/timeline\/oracle\/."},{"key":"e_1_2_1_5_1","unstructured":"Peloton. http:\/\/pelotondb.org.  Peloton. http:\/\/pelotondb.org."},{"key":"e_1_2_1_6_1","unstructured":"PostgreSQL. http:\/\/www.postgresql.org.  PostgreSQL. http:\/\/www.postgresql.org."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915231"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223785"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/356842.356846"},{"key":"e_1_2_1_10_1","author":"Bernstein P. A.","year":"2011","journal-title":"Hyder-A Transactional Record Manager for Shared Flash. In CIDR"},{"key":"e_1_2_1_11_1","unstructured":"P. A. Bernstein and etal Concurrency Control and Recovery in Database Systems. 1987.   P. A. Bernstein and et al. Concurrency Control and Recovery in Database Systems. 1987."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376690"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/6513.6517"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522714"},{"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.1145\/360363.360369"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809981"},{"key":"e_1_2_1_19_1","volume-title":"NSDI","author":"Fan B.","year":"2013"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071615"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/1921071.1921077"},{"key":"e_1_2_1_22_1","unstructured":"A. Harrison. InterBase's Beginnings. http:\/\/www.firebirdsql.org\/en\/ann-harrison-s-reminiscences-on-interbase-s-beginnings\/.  A. Harrison. InterBase's Beginnings. http:\/\/www.firebirdsql.org\/en\/ann-harrison-s-reminiscences-on-interbase-s-beginnings\/."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807227"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882905"},{"key":"e_1_2_1_25_1","unstructured":"E. Klitzke. Why uber engineering switched from postgres to mysql. https:\/\/eng.uber.com\/mysql-migration\/ July 2016.  E. Klitzke. Why uber engineering switched from postgres to mysql. https:\/\/eng.uber.com\/mysql-migration\/ July 2016."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/319566.319567"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/2095686.2095689"},{"issue":"2","key":"e_1_2_1_28_1","volume":"36","author":"Lee J.","year":"2013","journal-title":"High-Performance Transaction Processing in SAP HANA. IEEE Data Eng. Bull."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2903734"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.10"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544834"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816685"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_2_1_35_1","unstructured":"C. Mohan. ARIES\/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes. VLDB'90.   C. Mohan. ARIES\/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes. VLDB'90."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749436"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3003665.3003674"},{"key":"e_1_2_1_38_1","unstructured":"D. P. Reed. Naming and Synchronization in a Decentralized Computer System. Ph.D. dissertation 1978.  D. P. Reed. Naming and Synchronization in a Decentralized Computer System. Ph.D. dissertation 1978."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/357353.357355"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213946"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/16856.16888"},{"key":"e_1_2_1_42_1","volume-title":"VLDB","author":"Stonebraker M.","year":"2007"},{"key":"e_1_2_1_43_1","unstructured":"The Transaction Processing Council. TPC-C Benchmark (Revision 5.9.0). http:\/\/www.tpc.org\/tpcc\/spec\/tpcc_current.pdf June 2007.  The Transaction Processing Council. TPC-C Benchmark (Revision 5.9.0). http:\/\/www.tpc.org\/tpcc\/spec\/tpcc_current.pdf June 2007."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522713"},{"key":"e_1_2_1_45_1","doi-asserted-by":"crossref","unstructured":"T. Wang R. Johnson A. Fekete and I. Pandis. Efficiently Making (Almost) Any Concurrency Control Mechanism Serializable. arXiv:1605.04292 2016.  T. Wang R. Johnson A. Fekete and I. Pandis. Efficiently Making (Almost) Any Concurrency Control Mechanism Serializable. arXiv:1605.04292 2016.","DOI":"10.1007\/s00778-017-0463-8"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915202"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882935"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735511"},{"key":"e_1_2_1_49_1","volume-title":"OSDI","author":"Zheng W.","year":"2014"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3067421.3067427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:20:02Z","timestamp":1672219202000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3067421.3067427"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":49,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["10.14778\/3067421.3067427"],"URL":"https:\/\/doi.org\/10.14778\/3067421.3067427","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2017,3]]}}}