{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:56Z","timestamp":1740109316944,"version":"3.37.3"},"reference-count":133,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T00:00:00Z","timestamp":1550016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Youth Science and Technology - \u201cYang Fan\u201d Program","award":["17YF1427800"],"award-info":[{"award-number":["17YF1427800"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61772202","61702189"],"award-info":[{"award-number":["61772202","61702189"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10115-019-01340-7","type":"journal-article","created":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T10:36:40Z","timestamp":1550054200000},"page":"1209-1240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["In-memory transaction processing: efficiency and scalability considerations"],"prefix":"10.1007","volume":"61","author":[{"given":"Huiqi","family":"Hu","sequence":"first","affiliation":[]},{"given":"Xuan","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Weining","family":"Qian","sequence":"additional","affiliation":[]},{"given":"Aoying","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,13]]},"reference":[{"issue":"1","key":"1340_CR1","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/128765.128770","volume":"17","author":"C Mohan","year":"1992","unstructured":"Mohan C, Haderle D, Lindsay B, Pirahesh H, Schwarz P (1992) Aries: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging. TODS 17(1):94\u2013162","journal-title":"TODS"},{"key":"1340_CR2","unstructured":"Alibaba single day record. https:\/\/techcrunch.com\/2017\/11\/11\/alibaba-smashes-its-singles-day-record\/ . Accessed 2018"},{"issue":"4","key":"1340_CR3","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/2094114.2094126","volume":"40","author":"F F\u00e4rber","year":"2012","unstructured":"F\u00e4rber F, Cha SK, Primsch J, Bornh\u00f6vd C, Sigg S, Lehner W (2012) SAP HANA database: data management for modern business applications. SIGMOD Rec 40(4):45\u201351","journal-title":"SIGMOD Rec"},{"key":"1340_CR4","unstructured":"Lee J, Kwon YS, F\u00e4rber F, Muehle M, Lee C, Bensberg C, Lee JY, Lee AH, Lehner W (2013) SAP HANA distributed in-memory database system: transaction, session, and metadata management. In: ICDE. IEEE, pp 1165\u20131173"},{"issue":"2","key":"1340_CR5","first-page":"21","volume":"36","author":"M Stonebraker","year":"2013","unstructured":"Stonebraker M, Weisberg A (2013) The VoltDB main memory DBMS. IEEE Data Eng Bull 36(2):21\u201327","journal-title":"IEEE Data Eng Bull"},{"key":"1340_CR6","doi-asserted-by":"crossref","unstructured":"Kemper A, Neumann T (2011) Hyper: a hybrid OLTP&OLAP main memory database system based on virtual memory snapshots. In: ICDE. IEEE, pp 195\u2013206","DOI":"10.1109\/ICDE.2011.5767867"},{"issue":"1\u20132","key":"1340_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/1900000058","volume":"8","author":"F Faerber","year":"2017","unstructured":"Faerber F, Kemper A, Larson P-\u00c5, Levandoski J, Neumann T, Pavlo A et al (2017) Main memory database systems. Found Trends Databases 8(1\u20132):1\u2013130","journal-title":"Found Trends Databases"},{"issue":"7","key":"1340_CR8","doi-asserted-by":"crossref","first-page":"1920","DOI":"10.1109\/TKDE.2015.2427795","volume":"27","author":"H Zhang","year":"2015","unstructured":"Zhang H, Chen G, Ooi BC, Tan K-L, Zhang M (2015) In-memory big data management and processing: a survey. IEEE Trans Knowl Data Eng 27(7):1920\u20131948","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"1340_CR9","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/319566.319567","volume":"6","author":"H-T Kung","year":"1981","unstructured":"Kung H-T, Robinson JT (1981) On optimistic methods for concurrency control. TODS 6(2):213\u2013226","journal-title":"TODS"},{"key":"1340_CR10","doi-asserted-by":"crossref","unstructured":"Tu S, Zheng W, Kohler E, Liskov B, Madden S (2013) Speedy transactions in multicore in-memory databases. In: SOSP. ACM, pp 18\u201332","DOI":"10.1145\/2517349.2522713"},{"key":"1340_CR11","doi-asserted-by":"crossref","unstructured":"Diaconu C, Freedman C, Ismert E, Larson P-A, Mittal P, Stonecipher R, Verma N, Zwilling M (2013) Hekaton: SQL server\u2019s memory-optimized OLTP engine. In: SIGMOD. ACM, pp 1243\u20131254","DOI":"10.1145\/2463676.2463710"},{"issue":"4","key":"1340_CR12","doi-asserted-by":"crossref","first-page":"298","DOI":"10.14778\/2095686.2095689","volume":"5","author":"P-\u00c5 Larson","year":"2011","unstructured":"Larson P-\u00c5, Blanas S, Diaconu C, Freedman C, Patel JM, Zwilling M (2011) High-performance concurrency control mechanisms for main-memory databases. Proc VLDB Endow 5(4):298\u2013309","journal-title":"Proc VLDB Endow"},{"key":"1340_CR13","doi-asserted-by":"crossref","unstructured":"Yu X, Pavlo A, Sanchez D, Devadas S (2016) TicToc: time traveling optimistic concurrency control. In: SIGMOD, vol\u00a08, pp 209\u2013220","DOI":"10.1145\/2882903.2882935"},{"key":"1340_CR14","doi-asserted-by":"crossref","unstructured":"Wu Y, Chan C-Y, Tan K-L (2016) Transaction healing: scaling optimistic concurrency control on multicores. In: SIGMOD. ACM, pp 1689\u20131704","DOI":"10.1145\/2882903.2915202"},{"key":"1340_CR15","doi-asserted-by":"crossref","unstructured":"Neumann T, M\u00fchlbauer T, Kemper A (2015) Fast serializable multi-version concurrency control for main-memory database systems. In: SIGMOD. ACM, pp 677\u2013689","DOI":"10.1145\/2723372.2749436"},{"key":"1340_CR16","doi-asserted-by":"crossref","unstructured":"Loesing S, Pilman M, Etter T, Kossmann D (2015) On the design and scalability of distributed shared-data databases. In: SIGMOD. ACM, pp 663\u2013676","DOI":"10.1145\/2723372.2751519"},{"key":"1340_CR17","doi-asserted-by":"crossref","unstructured":"Jordan J, Banerjee J, Batman R (1981) Precision locks. In: SIGMOD. ACM, pp 143\u2013147","DOI":"10.1145\/582318.582340"},{"key":"1340_CR18","unstructured":"Zheng W, Tu S, Kohler E, Liskov B (2014) Fast databases with fast durability and recovery through multicore parallelism. In: OSDI, pp 465\u2013477"},{"issue":"11","key":"1340_CR19","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1145\/360363.360369","volume":"19","author":"KP Eswaran","year":"1976","unstructured":"Eswaran KP, Gray JN, Lorie RA, Traiger IL (1976) The notions of consistency and predicate locks in a database system. Commun ACM 19(11):624\u2013633","journal-title":"Commun ACM"},{"issue":"1","key":"1340_CR20","doi-asserted-by":"crossref","first-page":"479","DOI":"10.14778\/1687627.1687682","volume":"2","author":"R Johnson","year":"2009","unstructured":"Johnson R, Pandis I, Ailamaki A (2009) Improving OLTP scalability using speculative lock inheritance. Proc VLDB Endow 2(1):479\u2013489","journal-title":"Proc VLDB Endow"},{"issue":"4","key":"1340_CR21","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/2691190.2691192","volume":"39","author":"H Jung","year":"2014","unstructured":"Jung H, Han H, Fekete A, Heiser G, Yeom HY (2014) A scalable lock manager for multicores. TODS 39(4):29","journal-title":"TODS"},{"key":"1340_CR22","doi-asserted-by":"crossref","unstructured":"Harizopoulos S, Abadi DJ, Madden S, Stonebraker M (2008) OLTP through the looking glass, and what we found there. In: SIGMOD. ACM, pp 981\u2013992","DOI":"10.1145\/1376616.1376713"},{"issue":"2","key":"1340_CR23","doi-asserted-by":"crossref","first-page":"145","DOI":"10.14778\/2535568.2448947","volume":"6","author":"Kun Ren","year":"2012","unstructured":"Ren K, Thomson A, Abadi DJ (2012) Lightweight locking for main memory database systems. In: VLDB. vol\u00a06, pp 145\u2013156","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"1\u20132","key":"1340_CR24","doi-asserted-by":"crossref","first-page":"928","DOI":"10.14778\/1920841.1920959","volume":"3","author":"I Pandis","year":"2010","unstructured":"Pandis I, Johnson R, Hardavellas N, Ailamaki A (2010) Data-oriented transaction execution. Proc VLDB Endow 3(1\u20132):928\u2013939","journal-title":"Proc VLDB Endow"},{"key":"1340_CR25","doi-asserted-by":"crossref","unstructured":"Xie C, Su C, Littley C, Alvisi L, Kapritsos M, Wang Y (2015) High-performance acid via modular concurrency control. In: SOSP. ACM, pp 279\u2013294","DOI":"10.1145\/2815400.2815430"},{"key":"1340_CR26","unstructured":"Narula N, Cutler C, Kohler E, Morris R (2014) Phase reconciliation for contended in-memory transactions. In: OSDI, pp 511\u2013524"},{"issue":"3","key":"1340_CR27","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/211414.211427","volume":"20","author":"D Shasha","year":"1995","unstructured":"Shasha D, Llirbat F, Simon E, Valduriez P (1995) Transaction chopping: algorithms and performance studies. TODS 20(3):325\u2013363","journal-title":"TODS"},{"issue":"3","key":"1340_CR28","doi-asserted-by":"crossref","first-page":"209","DOI":"10.14778\/2735508.2735511","volume":"8","author":"X Yu","year":"2014","unstructured":"Yu X, Bezerra G, Pavlo A, Devadas S, Stonebraker M (2014) Staring into the abyss: an evaluation of concurrency control with one thousand cores. Proc VLDB Endow 8(3):209\u2013220","journal-title":"Proc VLDB Endow"},{"issue":"4","key":"1340_CR29","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1145\/32204.32220","volume":"12","author":"R Agrawal","year":"1987","unstructured":"Agrawal R, Carey MJ, Livny M (1987) Concurrency control performance modeling: alternatives and implications. TODS 12(4):609\u2013654","journal-title":"TODS"},{"issue":"4","key":"1340_CR30","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1145\/169725.169720","volume":"18","author":"A Thomasian","year":"1993","unstructured":"Thomasian A (1993) Two-phase locking performance and its thrashing behavior. TODS 18(4):579\u2013625","journal-title":"TODS"},{"key":"1340_CR31","unstructured":"Stonebraker M, Madden S, Abadi DJ, Harizopoulos S, Hachem N, Helland P (2007) The end of an architectural era: (it\u2019s time for a complete rewrite). In: VLDB. VLDB Endowment, pp 1150\u20131160"},{"issue":"2","key":"1340_CR32","first-page":"1496","volume":"1","author":"R Kallman","year":"2008","unstructured":"Kallman R, Kimura H, Natkins J, Pavlo A, Rasin A, Zdonik S, Jones EP, Madden S, Stonebraker M, Zhang Y et al (2008) H-store: a high-performance, distributed main memory transaction processing system. VLDB 1(2):1496\u20131499","journal-title":"VLDB"},{"key":"1340_CR33","doi-asserted-by":"crossref","unstructured":"Faleiro JM, Thomson A, Abadi DJ (2014) Lazy evaluation of transactions in database systems. In: SIGMOD. ACM, pp 15\u201326","DOI":"10.1145\/2588555.2610529"},{"issue":"1\u20132","key":"1340_CR34","doi-asserted-by":"crossref","first-page":"70","DOI":"10.14778\/1920841.1920855","volume":"3","author":"A Thomson","year":"2010","unstructured":"Thomson A, Abadi DJ (2010) The case for determinism in database systems. Proc VLDB Endow 3(1\u20132):70\u201380","journal-title":"Proc VLDB Endow"},{"key":"1340_CR35","doi-asserted-by":"crossref","unstructured":"Thomson A, Diamond T, Weng S-C, Ren K, Shao P, Abadi DJ (2012) CalvIn: fast distributed transactions for partitioned database systems. In: SIGMOD, pp 1\u201312","DOI":"10.1145\/2213836.2213838"},{"key":"1340_CR36","doi-asserted-by":"crossref","unstructured":"Jones EP, Abadi DJ, Madden S (2010) Low overhead concurrency control for partitioned main memory databases. In: SIGMOD. ACM, pp 603\u2013614","DOI":"10.1145\/1807167.1807233"},{"issue":"2","key":"1340_CR37","doi-asserted-by":"crossref","first-page":"85","DOI":"10.14778\/2078324.2078325","volume":"5","author":"A Pavlo","year":"2011","unstructured":"Pavlo A, Jones EP, Zdonik S (2011) On predictive modeling for optimizing transaction execution in parallel OLTP systems. Proc VLDB Endow 5(2):85\u201396","journal-title":"Proc VLDB Endow"},{"issue":"7","key":"1340_CR38","doi-asserted-by":"crossref","first-page":"781","DOI":"10.14778\/3067421.3067427","volume":"10","author":"Y Wu","year":"2017","unstructured":"Wu Y, Arulraj J, Lin J, Xian R, Pavlo A (2017) An empirical evaluation of in-memory multi-version concurrency control. Proc VLDB Endow 10(7):781\u2013792","journal-title":"Proc VLDB Endow"},{"key":"1340_CR39","volume-title":"Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery","author":"G Weikum","year":"2001","unstructured":"Weikum G, Vossen G (2001) Transactional information systems: theory, algorithms, and the practice of concurrency control and recovery. Elsevier, Amsterdam"},{"key":"1340_CR40","doi-asserted-by":"crossref","unstructured":"Diaconu C, Freedman C, Ismert E, Larson P-\u00c5, Mittal P et\u00a0al (2013) Hekaton: SQL server\u2019s memory-optimized OLTP engine. In: SIGMOD, pp 1243\u20131254","DOI":"10.1145\/2463676.2463710"},{"key":"1340_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/568271.223785","volume":"24","author":"H Berenson","year":"1995","unstructured":"Berenson H, Bernstein P, Gray J, Melton J, O\u2019Neil E, O\u2019Neil P (1995) A critique of ANSI SQL isolation levels. SIGMOD Rec 24:1\u201310","journal-title":"SIGMOD Rec"},{"issue":"2","key":"1340_CR42","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1145\/1071610.1071615","volume":"30","author":"A Fekete","year":"2005","unstructured":"Fekete A, Liarokapis D, O\u2019Neil E, O\u2019Neil P, Shasha D (2005) Making snapshot isolation serializable. TODS 30(2):492\u2013528","journal-title":"TODS"},{"key":"1340_CR43","unstructured":"Jorwekar S, Fekete A, Ramamritham K, Sudarshan S (2007) Automating the detection of snapshot isolation anomalies. In: VLDB, pp 1263\u20131274"},{"issue":"4","key":"1340_CR44","first-page":"20","volume":"34","author":"MJ Cahill","year":"2009","unstructured":"Cahill MJ, R\u00f6hm U, Fekete AD (2009) Serializable isolation for snapshot databases. DMoNH 34(4):20","journal-title":"DMoNH"},{"key":"1340_CR45","doi-asserted-by":"crossref","unstructured":"Revilak S, O\u2019Neil P, O\u2019Neil E (2011) Precisely serializable snapshot isolation (PSSI). In: ICDE. IEEE, pp 482\u2013493","DOI":"10.1109\/ICDE.2011.5767853"},{"issue":"12","key":"1340_CR46","doi-asserted-by":"crossref","first-page":"1850","DOI":"10.14778\/2367502.2367523","volume":"5","author":"DR Ports","year":"2012","unstructured":"Ports DR, Grittner K (2012) Serializable snapshot isolation in PostgreSQL. Proc VLDB Endow 5(12):1850\u20131861","journal-title":"Proc VLDB Endow"},{"key":"1340_CR47","doi-asserted-by":"crossref","unstructured":"Wang T, Johnson R, Fekete A, Pandis I (2015) The serial safety net: efficient concurrency control on modern hardware. In: DMoNH. ACM, p\u00a08","DOI":"10.1145\/2771937.2771949"},{"key":"1340_CR48","unstructured":"Adya A, Liskov BH (1999) Weak consistency: a generalized theory and optimistic implementations for distributed transactions. Doctoral dissertation, Massachusetts Institute of Technology"},{"key":"1340_CR49","doi-asserted-by":"crossref","unstructured":"Kim K, Wang T, Johnson R, Pandis I (2016) ERMIA: fast memory-optimized database system for heterogeneous workloads. In: SIGMOD. ACM, pp 1675\u20131687","DOI":"10.1145\/2882903.2882905"},{"key":"1340_CR50","doi-asserted-by":"crossref","unstructured":"Jung H, Han H, Fekete A, R\u00f6hm U, Yeom HY (2013) Performance of serializable snapshot isolation on multicore servers. In: DASFAA (2), Lecture Notes in Computer Science. Springer, pp 416\u2013430","DOI":"10.1007\/978-3-642-37450-0_31"},{"key":"1340_CR51","doi-asserted-by":"crossref","unstructured":"Han H, Park S, Jung H, Fekete A, Rohm U, Yeom HY (2014) Scalable serializable snapshot isolation for multicore systems. In: ICDE","DOI":"10.1109\/ICDE.2014.6816693"},{"key":"1340_CR52","doi-asserted-by":"crossref","unstructured":"Malviya N, Weisberg A, Madden S, Stonebraker M (2014) Rethinking main memory OLTP recovery. In: ICDE. IEEE, pp 604\u2013615","DOI":"10.1109\/ICDE.2014.6816685"},{"key":"1340_CR53","doi-asserted-by":"crossref","unstructured":"Yao C, Agrawal D, Chen G, Ooi BC, Wu S (2016) Adaptive logging: optimizing logging and recovery costs in distributed in-memory databases. In: SIGMOD. ACM, pp 1119\u20131134","DOI":"10.1145\/2882903.2915208"},{"issue":"1\u20132","key":"1340_CR54","doi-asserted-by":"crossref","first-page":"681","DOI":"10.14778\/1920841.1920928","volume":"3","author":"R Johnson","year":"2010","unstructured":"Johnson R, Pandis I, Stoica R, Athanassoulis M, Ailamaki A (2010) Aether: a scalable approach to logging. Proc VLDB Endow 3(1\u20132):681\u2013692","journal-title":"Proc VLDB Endow"},{"issue":"10","key":"1340_CR55","doi-asserted-by":"crossref","first-page":"865","DOI":"10.14778\/2732951.2732960","volume":"7","author":"T Wang","year":"2014","unstructured":"Wang T, Johnson R (2014) Scalable logging through emerging non-volatile memory. Proc VLDB Endow 7(10):865\u2013876","journal-title":"Proc VLDB Endow"},{"key":"1340_CR56","doi-asserted-by":"crossref","unstructured":"Helland P, Sammer H, Lyon J, Carr R, Garrett P, Reuter A (1989) Group commit timers and high volume transaction systems. In: High performance transaction systems. Springer, pp 301\u2013329","DOI":"10.1007\/3-540-51085-0_52"},{"issue":"2","key":"1340_CR57","first-page":"135","volume":"11","author":"H Jung","year":"2017","unstructured":"Jung H, Han H, Kang S (2017) Scalable database logging for multicores. PVLDB 11(2):135\u2013148","journal-title":"PVLDB"},{"key":"1340_CR58","doi-asserted-by":"crossref","unstructured":"Fang R, Hsiao H-I, He B, Mohan C, Wang Y (2011) High performance database logging using storage class memory. In: ICDE. IEEE, pp 1221\u20131231","DOI":"10.1109\/ICDE.2011.5767918"},{"issue":"4","key":"1340_CR59","doi-asserted-by":"crossref","first-page":"389","DOI":"10.14778\/2735496.2735502","volume":"8","author":"J Huang","year":"2014","unstructured":"Huang J, Schwan K, Qureshi MK (2014) NVRAM-aware logging in transaction systems. Proc VLDB Endow 8(4):389\u2013400","journal-title":"Proc VLDB Endow"},{"key":"1340_CR60","unstructured":"NVM (2018) https:\/\/en.wikipedia.org\/wiki\/Non-volatile_memory . Accessed 2018"},{"key":"1340_CR61","doi-asserted-by":"crossref","unstructured":"Wu Y, Guo W, Chan C, Tan K (2017) Fast failure recovery for main-memory DBMSs on multicores. In: SIGMOD, pp 267\u2013281","DOI":"10.1145\/3035918.3064011"},{"issue":"4","key":"1340_CR62","doi-asserted-by":"crossref","first-page":"337","DOI":"10.14778\/3025111.3025116","volume":"10","author":"J Arulraj","year":"2016","unstructured":"Arulraj J, Perron M, Pavlo A (2016) Write-behind logging. Proc VLDB Endow 10(4):337\u2013348","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"1340_CR63","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D Comer","year":"1979","unstructured":"Comer D (1979) The ubiquitous b-tree. ACM Comput Surv 11(2):121\u2013137","journal-title":"ACM Comput Surv"},{"key":"1340_CR64","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1145\/335191.335449","volume":"29","author":"J Rao","year":"2000","unstructured":"Rao J, Ross KA (2000) Making b+-trees cache conscious in main memory. SIGMOD Rec 29:475\u2013486","journal-title":"SIGMOD Rec"},{"key":"1340_CR65","unstructured":"Rao J, Ross KA (1999) Cache conscious indexing for decision-support in main memory. In: VLDB, pp 78\u201389"},{"key":"1340_CR66","doi-asserted-by":"crossref","unstructured":"Schlegel B, Gemulla R, Lehner W (2009) K-ary search on modern processors. In: Proceedings of the fifth international workshop on data management on new hardware, DaMoN \u201909. ACM, New York, pp 52\u201360","DOI":"10.1145\/1565694.1565705"},{"key":"1340_CR67","doi-asserted-by":"crossref","unstructured":"Kim C, Chhugani J, Satish N, Sedlar E, Nguyen AD, Kaldewey T, Lee VW, Brandt SA, Dubey P (2010) Fast: fast architecture sensitive tree search on modern CPUs and GPUs. In: SIGMOD, ACM, pp 339\u2013350","DOI":"10.1145\/1807167.1807206"},{"key":"1340_CR68","doi-asserted-by":"crossref","unstructured":"Mao Y, Kohler E, Morris RT (2012) Cache craftiness for fast multicore key-value storage. In: EuroSys. ACM, pp 183\u2013196","DOI":"10.1145\/2168836.2168855"},{"key":"1340_CR69","doi-asserted-by":"crossref","unstructured":"Kraska T, Beutel A, Chi EH, Dean J, Polyzotis N (2018) The case for learned index structures. In: SIGMOD, pp 489\u2013504","DOI":"10.1145\/3183713.3196909"},{"key":"1340_CR70","doi-asserted-by":"crossref","unstructured":"Leis V, Kemper A, Neumann T (2013) The adaptive radix tree: artful indexing for main-memory databases. In: ICDE. IEEE, pp 38\u201349","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"1340_CR71","unstructured":"Tree R. https:\/\/en.wikipedia.org\/wiki\/trie"},{"key":"1340_CR72","unstructured":"B\u00f6hm M, Schlegel B, Volk PB, Fischer U, Habich D, Lehner W (2011) Efficient in-memory indexing with generalized prefix trees. In: BTW, Germany, pp 227\u2013246"},{"key":"1340_CR73","doi-asserted-by":"crossref","unstructured":"Zhang H, Andersen DG, Pavlo A, Kaminsky M, Ma L, Shen R (2016) Reducing the storage overhead of main-memory OLTP databases with hybrid indexes. In: SIGMOD. ACM, pp 1567\u20131581","DOI":"10.1145\/2882903.2915222"},{"key":"1340_CR74","doi-asserted-by":"crossref","unstructured":"Wang Z, Pavlo A, Lim H, Leis V, Zhang H, Kaminsky M, Andersen DG (2018) Building a Bw-tree takes more than just buzz words. In: SIGMOD conference. ACM, pp 473\u2013488","DOI":"10.1145\/3183713.3196895"},{"key":"1340_CR75","doi-asserted-by":"crossref","unstructured":"Binna R, Zangerle E, Pichl M, Specht G, Leis V (2018) HOT: a height optimized Trie index for main-memory database systems. In: SIGMOD, pp 521\u2013534","DOI":"10.1145\/3183713.3196896"},{"key":"1340_CR76","doi-asserted-by":"crossref","unstructured":"Zhang H, Lim H, Leis V, Andersen DG, Kaminsky M, Keeton K, Pavlo A (2018) Surf: practical range query filtering with fast succinct tries. In: SIGMOD, pp 323\u2013336","DOI":"10.1145\/3183713.3196931"},{"key":"1340_CR77","doi-asserted-by":"crossref","unstructured":"Jacobson G (1989) Space-efficient static trees and graphs. In: 30th annual symposium on foundations of computer science, Research Triangle Park, NC, USA, 30 Oct\u20131 Nov 1989, pp 549\u2013554","DOI":"10.1109\/SFCS.1989.63533"},{"key":"1340_CR78","doi-asserted-by":"crossref","unstructured":"Stoica R, Ailamaki A (2013) Enabling efficient OS paging for main-memory OLTP databases. In: DaMoN, p\u00a07","DOI":"10.1145\/2485278.2485285"},{"issue":"11","key":"1340_CR79","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.14778\/2350229.2350258","volume":"5","author":"F Funke","year":"2012","unstructured":"Funke F, Kemper A, Neumann T (2012) Compacting transactional data in hybrid OLTP&OLAP databases. Proc VLDB Endow 5(11):1424\u20131435","journal-title":"Proc VLDB Endow"},{"issue":"11","key":"1340_CR80","doi-asserted-by":"crossref","first-page":"931","DOI":"10.14778\/2732967.2732968","volume":"7","author":"A Eldawy","year":"2014","unstructured":"Eldawy A, Levandoski J, Larson P-\u00c5 (2014) Trekking through siberia: managing cold data in a memory-optimized database. Proc VLDB Endow 7(11):931\u2013942","journal-title":"Proc VLDB Endow"},{"key":"1340_CR81","doi-asserted-by":"crossref","unstructured":"Levandoski JJ, Larson P-\u00c5, Stoica R (2013) Identifying hot and cold data in main-memory databases. In: ICDE. IEEE, pp 26\u201337","DOI":"10.1109\/ICDE.2013.6544811"},{"key":"1340_CR82","unstructured":"Cache replacement. https:\/\/en.wikipedia.org\/wiki\/cache-replacement-policies . Accessed 2018"},{"issue":"14","key":"1340_CR83","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.14778\/2556549.2556575","volume":"6","author":"J DeBrabant","year":"2013","unstructured":"DeBrabant J, Pavlo A, Tu S, Stonebraker M, Zdonik S (2013) Anti-caching: a new approach to database management system architecture. Proc VLDB Endow 6(14):1942\u20131953","journal-title":"Proc VLDB Endow"},{"key":"1340_CR84","doi-asserted-by":"crossref","unstructured":"Lang H, M\u00fchlbauer T, Funke F, Boncz PA, Neumann T, Kemper A (2016) Data blocks: hybrid OLTP and OLAP on compressed storage using both vectorization and compilation. In: SIGMOD. ACM, pp 311\u2013326","DOI":"10.1145\/2882903.2882925"},{"key":"1340_CR85","doi-asserted-by":"crossref","unstructured":"Levandoski JJ, Lomet DB, Sengupta S (2013) The Bw-tree: a b-tree for new hardware platforms. In: ICDE. IEEE, pp 302\u2013313","DOI":"10.1109\/ICDE.2013.6544834"},{"issue":"3","key":"1340_CR86","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/1806907.1806908","volume":"35","author":"G Graefe","year":"2010","unstructured":"Graefe G (2010) A survey of b-tree locking techniques. TODS 35(3):16","journal-title":"TODS"},{"issue":"4","key":"1340_CR87","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1145\/319628.319663","volume":"6","author":"PL Lehman","year":"1981","unstructured":"Lehman PL et al (1981) Efficient locking for concurrent operations on b-trees. TODS 6(4):650\u2013670","journal-title":"TODS"},{"key":"1340_CR88","unstructured":"Cha SK, Hwang S, Kim K, Kwon K (2001) Cache-conscious concurrency control of main-memory indexes on shared-memory multiprocessor systems. In: VLDB, vol\u00a01, pp 181\u2013190"},{"issue":"11","key":"1340_CR89","doi-asserted-by":"crossref","first-page":"795","DOI":"10.14778\/3402707.3402719","volume":"4","author":"J Sewall","year":"2011","unstructured":"Sewall J, Chhugani J, Kim C, Satish N, Dubey P (2011) PALM: parallel architecture-friendly latch-free modifications to b+ trees on many-core processors. Proc VLDB Endow 4(11):795\u2013806","journal-title":"Proc VLDB Endow"},{"issue":"9","key":"1340_CR90","doi-asserted-by":"crossref","first-page":"539","DOI":"10.14778\/2002938.2002940","volume":"4","author":"T Neumann","year":"2011","unstructured":"Neumann T (2011) Efficiently compiling efficient query plans for modern hardware. Proc VLDB Endow 4(9):539\u2013550","journal-title":"Proc VLDB Endow"},{"issue":"1","key":"1340_CR91","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/69.273032","volume":"6","author":"G Graefe","year":"1994","unstructured":"Graefe G (1994) Volcano: an extensible and parallel query evaluation system. IEEE Trans Knowl Data Eng 6(1):120\u2013135","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"1340_CR92","doi-asserted-by":"crossref","first-page":"444","DOI":"10.14778\/2876473.2876479","volume":"9","author":"C Yan","year":"2016","unstructured":"Yan C, Cheung A (2016) Leveraging lock contention to improve OLTP application performance. Proc VLDB Endow 9(5):444\u2013455","journal-title":"Proc VLDB Endow"},{"key":"1340_CR93","doi-asserted-by":"crossref","unstructured":"Wang Z, Mu S, Cui Y, Yi H, Chen H, Li J (2016) Scaling multicore databases via constrained parallel execution. In: SIGMOD. ACM, pp 1643\u20131658","DOI":"10.1145\/2882903.2882934"},{"key":"1340_CR94","doi-asserted-by":"crossref","unstructured":"Wang Z, Mu S, Cui Y, Yi H, Chen H, Li J (2016) Scaling multicore databases via constrained parallel execution. In: SIGMOD, ACM. New York, NY, pp 1643\u20131658","DOI":"10.1145\/2882903.2882934"},{"key":"1340_CR95","unstructured":"Mu S, Cui Y, Zhang Y, Lloyd W, Li J (2014) Extracting more concurrency from distributed transactions. In: OSDI, pp 479\u2013494"},{"issue":"1\u20132","key":"1340_CR96","doi-asserted-by":"crossref","first-page":"48","DOI":"10.14778\/1920841.1920853","volume":"3","author":"C Curino","year":"2010","unstructured":"Curino C, Jones E, Zhang Y, Madden S (2010) Schism: a workload-driven approach to database replication and partitioning. Proc VLDB Endow 3(1\u20132):48\u201357","journal-title":"Proc VLDB Endow"},{"key":"1340_CR97","doi-asserted-by":"crossref","unstructured":"Pavlo A, Curino C, Zdonik S (2012) Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems. In: SIGMOD. ACM, pp 61\u201372","DOI":"10.1145\/2213836.2213844"},{"issue":"3","key":"1340_CR98","doi-asserted-by":"crossref","first-page":"245","DOI":"10.14778\/2735508.2735514","volume":"8","author":"R Taft","year":"2014","unstructured":"Taft R, Mansour E, Serafini M, Duggan J, Elmore AJ, Aboulnaga A, Pavlo A, Stonebraker M (2014) E-store: fine-grained elastic partitioning for distributed transaction processing systems. Proc VLDB Endow 8(3):245\u2013256","journal-title":"Proc VLDB Endow"},{"key":"1340_CR99","unstructured":"Two-phase commit protocol. https:\/\/en.wikipedia.org\/wiki\/two-phase-commit-protocol . Accessed 2018"},{"key":"1340_CR100","doi-asserted-by":"crossref","unstructured":"Lin Q, Chang P, Chen G, Ooi BC, Tan K-L, Wang Z (2016) Towards a non-2pc transaction management in distributed database systems. In: SIGMOD","DOI":"10.1145\/2882903.2882923"},{"issue":"10","key":"1340_CR101","doi-asserted-by":"crossref","first-page":"821","DOI":"10.14778\/2732951.2732955","volume":"7","author":"K Ren","year":"2014","unstructured":"Ren K, Thomson A, Abadi DJ (2014) An evaluation of the advantages and disadvantages of deterministic database systems. Proc VLDB Endow 7(10):821\u2013832","journal-title":"Proc VLDB Endow"},{"key":"1340_CR102","unstructured":"Ailamaki A, DeWitt DJ, Hill MD, Wood DA (1999) DBMSs on a modern processor: where does time go? In: VLDB, pp 266\u2013277"},{"key":"1340_CR103","doi-asserted-by":"crossref","unstructured":"Sirin U, T\u00f6z\u00fcn P, Porobic D, Ailamaki A (2016) Micro-architectural analysis of in-memory OLTP. In: SIGMOD, Vol. 215922","DOI":"10.1145\/2882903.2882916"},{"key":"1340_CR104","doi-asserted-by":"crossref","unstructured":"T\u00f6z\u00fcn P, Gold B, Ailamaki A (2013) OLTP in wonderland: where do cache misses come from in major OLTP components?. In: DaMoN. ACM, p\u00a08","DOI":"10.1145\/2485278.2485286"},{"key":"1340_CR105","doi-asserted-by":"crossref","unstructured":"Miller JE, Kasture H, Kurian G, Gruenwald C, Beckmann N, Celio C, Eastep J, Agarwal A (2010) Graphite: a distributed parallel simulator for multicores. In: HPCA-16. IEEE, pp 1\u201312","DOI":"10.1109\/HPCA.2010.5416635"},{"key":"1340_CR106","unstructured":"Salomie T-I, Subasu IE, Giceva J, Alonso G (2011) Database engines on multicores, why parallelize when you can distribute? In: EuroSys. ACM, pp 17\u201330"},{"issue":"2","key":"1340_CR107","doi-asserted-by":"crossref","first-page":"121","DOI":"10.14778\/3149193.3149194","volume":"11","author":"R Appuswamy","year":"2017","unstructured":"Appuswamy R, Anadiotis A, Porobic D, Iman M, Ailamaki A (2017) Analyzing the impact of system architecture on the scalability of OLTP engines for high-contention workloads. Proc VLDB Endow 11(2):121\u2013134","journal-title":"Proc VLDB Endow"},{"key":"1340_CR108","doi-asserted-by":"crossref","unstructured":"M\u00fchlbauer T, R\u00f6diger W, Reiser A, Kemper A, Neumann T (2013) ScyPer: elastic OLAP throughput on transactional data. In: DanaC. ACM, pp 11\u201315","DOI":"10.1145\/2486767.2486770"},{"issue":"2","key":"1340_CR109","first-page":"6","volume":"36","author":"T Lahiri","year":"2013","unstructured":"Lahiri T, Neimat M-A, Folkman S (2013) Oracle TimesTen: an in-memory database for enterprise applications. IEEE Data Eng Bull 36(2):6\u201313","journal-title":"IEEE Data Eng Bull"},{"issue":"2","key":"1340_CR110","first-page":"14","volume":"36","author":"J Lindstr\u00f6m","year":"2013","unstructured":"Lindstr\u00f6m J, Raatikka V, Ruuth J, Soini P, Vakkila K (2013) IBM solidDB: in-memory database optimized for extreme speed and availability. IEEE Data Eng Bull 36(2):14\u201320","journal-title":"IEEE Data Eng Bull"},{"key":"1340_CR111","unstructured":"MemSQL\u00a0Inc., MemSQL. http:\/\/www.memsql.com . Accessed 2018"},{"issue":"1","key":"1340_CR112","first-page":"22","volume":"37","author":"C Freedman","year":"2014","unstructured":"Freedman C, Ismert E, Larson P-\u00c5 (2014) Compilation in the Microsoft SQL Server Hekaton engine. IEEE Data Eng Bull 37(1):22\u201330","journal-title":"IEEE Data Eng Bull"},{"key":"1340_CR113","doi-asserted-by":"crossref","unstructured":"Lattner C, Adve V (2004) LLVM: a compilation framework for lifelong program analysis & transformation. In: CGO. IEEE, pp 75\u201386","DOI":"10.1109\/CGO.2004.1281665"},{"issue":"9","key":"1340_CR114","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E Fredkin","year":"1960","unstructured":"Fredkin E (1960) Trie memory. CACM 3(9):490\u2013499","journal-title":"CACM"},{"key":"1340_CR115","doi-asserted-by":"crossref","unstructured":"Wolski A, Raatikka V (2006) Performance measurement and tuning of hot-standby databases. In: International service availability symposium. Springer, pp 149\u2013161","DOI":"10.1007\/11955498_11"},{"key":"1340_CR116","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1145\/276305.276336","volume":"27","author":"C-Y Chan","year":"1998","unstructured":"Chan C-Y, Ioannidis YE (1998) Bitmap index design and evaluation. SIGMOD Rec 27:355\u2013366","journal-title":"SIGMOD Rec"},{"key":"1340_CR117","volume-title":"Concurrency control and recovery in database systems","author":"PA Bernstein","year":"1987","unstructured":"Bernstein PA, Hadzilacos V, Goodman N (1987) Concurrency control and recovery in database systems. Addison-Wesley, Boston"},{"key":"1340_CR118","unstructured":"Altibase. Altibase administrator\u2019s manual release"},{"key":"1340_CR119","unstructured":"Pavlo A, Angulo G, Arulraj J, Lin H, Lin J, Ma L, Menon P, Mowry TC, Perron M, Quah I, Santurkar S, Tomasic A, Toor S, Aken DV, Wang Z, Wu Y, Xian R, Zhang T (2017) Self-driving database management systems. In: CIDR. www.cidrdb.org"},{"key":"1340_CR120","unstructured":"Peloton. https:\/\/github.com\/cmu-db\/peloton . Accessed 2018"},{"key":"1340_CR121","doi-asserted-by":"crossref","unstructured":"Sikka V, F\u00e4rber F, Lehner W, Cha SK, Peh T, Bornh\u00f6vd C (2012) Efficient transaction processing in SAP HANA database: the end of a column store myth. In: SIGMOD. ACM, pp 731\u2013742","DOI":"10.1145\/2213836.2213946"},{"issue":"2","key":"1340_CR122","doi-asserted-by":"crossref","first-page":"49","DOI":"10.14778\/3015274.3015276","volume":"10","author":"T Wang","year":"2016","unstructured":"Wang T, Kimura H (2016) Mostly-optimistic concurrency control for highly contended dynamic workloads on a thousand cores. Proc VLDB Endw 10(2):49\u201360","journal-title":"Proc VLDB Endw"},{"key":"1340_CR123","doi-asserted-by":"crossref","unstructured":"Pavlo A (2017) What are we doing with our lives? Nobody cares about our concurrency control research. In: SIGMOD, p\u00a03","DOI":"10.1145\/3035918.3056096"},{"key":"1340_CR124","first-page":"228","volume-title":"Database Systems for Advanced Applications","author":"Tao Zhu","year":"2018","unstructured":"Zhu T, Wang D, Hu H, Qian W, Wang X, Zhou A (2018) Interactive transaction processing for in-memory database system. In: DASFAA, part II, pp 228\u2013246"},{"issue":"2","key":"1340_CR125","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1145\/235968.233330","volume":"25","author":"J Gray","year":"1996","unstructured":"Gray J et al (1996) The dangers of replication and a solution. SIGMOD Rec 25(2):173\u2013182","journal-title":"SIGMOD Rec"},{"key":"1340_CR126","doi-asserted-by":"crossref","unstructured":"Decandia G et\u00a0al (2007) Dynamo: Amazon\u2019s highly available key-value store. In: SOSP","DOI":"10.1145\/1294261.1294281"},{"key":"1340_CR127","unstructured":"Cassandra website. http:\/\/cassandra.apache.org\/ . Accessed 2018"},{"issue":"3","key":"1340_CR128","doi-asserted-by":"crossref","first-page":"181","DOI":"10.14778\/2732232.2732237","volume":"7","author":"P Bailis","year":"2013","unstructured":"Bailis P, Davidson A, Fekete A et al (2013) Highly available transactions: virtues and limitations. Proc VLDB Endow 7(3):181\u2013192","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"1340_CR129","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport L (1998) The part-time parliament. TOCS 16(2):133\u2013169","journal-title":"TOCS"},{"issue":"4","key":"1340_CR130","first-page":"18","volume":"32","author":"L Lamport","year":"2001","unstructured":"Lamport L (2001) Paxos made simple. ACM SIGACT News 32(4):18\u201325","journal-title":"ACM SIGACT News"},{"key":"1340_CR131","unstructured":"Baker J, Bond C, Corbett JC et\u00a0al (2011) Megastore: providing scalable, highly available storage for interactive services. In: CIDR, pp 223\u2013234"},{"issue":"3","key":"1340_CR132","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/2518037.2491245","volume":"31","author":"JC Corbett","year":"2013","unstructured":"Corbett JC, Jeffrey D et al (2013) Spanner: Googles globally distributed database. TOCS 31(3):8","journal-title":"TOCS"},{"key":"1340_CR133","doi-asserted-by":"crossref","unstructured":"Rao J, Shekita EJ, Tata S (2011) Using paxos to build a scalable, consistent, and highly available datastore. In: VLDB, pp 243\u2013254","DOI":"10.14778\/1938545.1938549"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-019-01340-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-019-01340-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-019-01340-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,27]],"date-time":"2020-11-27T16:36:53Z","timestamp":1606495013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-019-01340-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,13]]},"references-count":133,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["1340"],"URL":"https:\/\/doi.org\/10.1007\/s10115-019-01340-7","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2019,2,13]]},"assertion":[{"value":"30 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}