{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:44:37Z","timestamp":1743101077975,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319639628"},{"type":"electronic","value":"9783319639628"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-63962-8_177-1","type":"book-chapter","created":{"date-parts":[[2018,9,12]],"date-time":"2018-09-12T07:18:38Z","timestamp":1536736718000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["In-Memory Transactions"],"prefix":"10.1007","author":[{"given":"Spyros","family":"Blanas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,22]]},"reference":[{"issue":"4","key":"177-1_CR1","first-page":"337","volume":"10","author":"J Arulraj","year":"2016","unstructured":"Arulraj J, Perron M, Pavlo A (2016) Write-behind logging. PVLDB 10(4):337\u2013348","journal-title":"PVLDB"},{"key":"177-1_CR2","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, Reading"},{"issue":"1","key":"177-1_CR3","first-page":"48","volume":"3","author":"C Curino","year":"2010","unstructured":"Curino C, Zhang Y, Jones EPC, Madden S (2010) Schism: a workload-driven approach to database replication and partitioning. PVLDB 3(1):48\u201357","journal-title":"PVLDB"},{"key":"177-1_CR4","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1145\/2463676.2463710","volume-title":"Proceedings of the 2013 ACM SIGMOD international conference on management of Data (SIGMOD\u201913)","author":"C Diaconu","year":"2013","unstructured":"Diaconu C, Freedman C, Ismert E, Larson PA, Mittal P, Stonecipher R, Verma N, Zwilling M (2013) Hekaton: SQL server\u2019s memory-optimized OLTP engine. In: Proceedings of the 2013 ACM SIGMOD international conference on management of Data (SIGMOD\u201913). ACM, New York, pp 1243\u20131254. https:\/\/doi.org\/10.1145\/2463676.2463710"},{"key":"177-1_CR5","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1145\/1376616.1376713","volume-title":"SIGMOD\u201908: proceedings of the 2008 ACM SIGMOD international conference on management of data","author":"S Harizopoulos","year":"2008","unstructured":"Harizopoulos S, Abadi DJ, Madden S, Stonebraker M (2008) OLTP through the looking glass, and what we found there. In: SIGMOD\u201908: proceedings of the 2008 ACM SIGMOD international conference on management of data. ACM, New York, pp 981\u2013992. https:\/\/doi.org\/10.1145\/1376616.1376713"},{"issue":"1\u20132","key":"177-1_CR6","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.14778\/1920841.1920928","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"177-1_CR7","doi-asserted-by":"publisher","first-page":"1496","DOI":"10.14778\/1454159.1454211","volume":"1","author":"R Kallman","year":"2008","unstructured":"Kallman R, Kimura H, Natkins J, Pavlo A, Rasin A, Zdonik S, Jones EPC, Madden S, Stonebraker M, Zhang Y, Hugg J, Abadi DJ (2008) H-Store: a high-performance, distributed main memory transaction processing system. Proc VLDB Endow 1(2):1496\u20131499. https:\/\/doi.org\/10.1145\/1454159.1454211","journal-title":"Proc VLDB Endow"},{"key":"177-1_CR8","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1145\/2882903.2882905","volume-title":"Proceedings of the 2016 international conference on management of data (SIGMOD\u201916)","author":"K Kim","year":"2016","unstructured":"Kim K, Wang T, Johnson R, Pandis I (2016) Ermia: fast memory-optimized database system for heterogeneous workloads. In: Proceedings of the 2016 international conference on management of data (SIGMOD\u201916). ACM, New York, pp 1675\u20131687. https:\/\/doi.org\/10.1145\/2882903.2882905"},{"key":"177-1_CR9","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1145\/2723372.2746480","volume-title":"Proceedings of the 2015 ACM SIGMOD international conference on management of data (SIGMOD\u201915)","author":"H Kimura","year":"2015","unstructured":"Kimura H (2015) Foedus: OLTP engine for a thousand cores and NVRAM. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data (SIGMOD\u201915). ACM, New York, pp 691\u2013706. https:\/\/doi.org\/10.1145\/2723372.2746480"},{"issue":"2","key":"177-1_CR10","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/319566.319567","volume":"6","author":"HT Kung","year":"1981","unstructured":"Kung HT, Robinson JT (1981) On optimistic methods for concurrency control. ACM Trans Database Syst 6(2):213\u2013226. https:\/\/doi.org\/10.1145\/319566.319567","journal-title":"ACM Trans Database Syst"},{"issue":"4","key":"177-1_CR11","first-page":"298","volume":"5","author":"P Larson","year":"2011","unstructured":"Larson P, Blanas S, Diaconu C, Freedman C, Patel JM, Zwilling M (2011) High-performance concurrency control mechanisms for main-memory databases. PVLDB 5(4):298\u2013309","journal-title":"PVLDB"},{"issue":"4","key":"177-1_CR12","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1145\/319628.319663","volume":"6","author":"PL Lehman","year":"1981","unstructured":"Lehman PL, Yao SB (1981) Efficient locking for concurrent operations on b-trees. ACM Trans Database Syst 6(4):650\u2013670. https:\/\/doi.org\/10.1145\/319628.319663","journal-title":"ACM Trans Database Syst"},{"key":"177-1_CR13","doi-asserted-by":"publisher","unstructured":"Levandoski JJ, Lomet DB, Sengupta S (2013) The bw-tree: a b-tree for new hardware platforms. In: 2013 IEEE 29th international conference on data engineering (ICDE), pp 302\u2013313. https:\/\/doi.org\/10.1109\/ICDE.2013.6544834","DOI":"10.1109\/ICDE.2013.6544834"},{"key":"177-1_CR14","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/2168836.2168855","volume-title":"Proceedings of the 7th ACM European conference on computer systems (EuroSys\u201912)","author":"Y Mao","year":"2012","unstructured":"Mao Y, Kohler E, Morris RT (2012) Cache craftiness for fast multicore key-value storage. In: Proceedings of the 7th ACM European conference on computer systems (EuroSys\u201912). ACM, New York, pp 183\u2013196. https:\/\/doi.org\/10.1145\/2168836.2168855"},{"issue":"6","key":"177-1_CR15","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TPDS.2004.8","volume":"15","author":"MM Michael","year":"2004","unstructured":"Michael MM (2004a) Hazard pointers: safe memory reclamation for lock-free objects. IEEE Trans Parallel Distrib Syst 15(6):491\u2013504. https:\/\/doi.org\/10.1109\/TPDS.2004.8","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"6","key":"177-1_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/996893.996848","volume":"39","author":"MM Michael","year":"2004","unstructured":"Michael MM (2004b) Scalable lock-free dynamic memory allocation. SIGPLAN Not 39(6):35\u201346. https:\/\/doi.org\/10.1145\/996893.996848","journal-title":"SIGPLAN Not"},{"issue":"1","key":"177-1_CR17","doi-asserted-by":"publisher","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. ACM Trans Database Syst 17(1):94\u2013162. https:\/\/doi.org\/10.1145\/128765.128770","journal-title":"ACM Trans Database Syst"},{"issue":"1","key":"177-1_CR18","first-page":"928","volume":"3","author":"I Pandis","year":"2010","unstructured":"Pandis I, Johnson R, Hardavellas N, Ailamaki A (2010) Data-oriented transaction execution. PVLDB 3(1):928\u2013939","journal-title":"PVLDB"},{"key":"177-1_CR19","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1145\/2882903.2882958","volume-title":"Proceedings of the 2016 international conference on management of data (SIGMOD\u201916)","author":"K Ren","year":"2016","unstructured":"Ren K, Faleiro JM, Abadi DJ (2016) Design principles for scaling multi-core OLTP under high contention. In: Proceedings of the 2016 international conference on management of data (SIGMOD\u201916). ACM, New York, pp 1583\u20131598. https:\/\/doi.org\/10.1145\/2882903.2882958"},{"issue":"13","key":"177-1_CR20","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.14778\/2733004.2733006","volume":"7","author":"M Sadoghi","year":"2014","unstructured":"Sadoghi M, Canim M, Bhattacharjee B, Nagel F, Ross KA (2014) Reducing database locking contention through multi-version concurrency. Proc VLDB Endow 7(13):1331\u20131342. https:\/\/doi.org\/10.14778\/2733004.2733006","journal-title":"Proc VLDB Endow"},{"issue":"4","key":"177-1_CR21","first-page":"445","volume":"10","author":"M Serafini","year":"2016","unstructured":"Serafini M, Taft R, Elmore AJ, Pavlo A, Aboulnaga A, Stonebraker M (2016) Clay: fine-grained adaptive partitioning for general database schemas. PVLDB 10(4):445\u2013456","journal-title":"PVLDB"},{"key":"177-1_CR22","first-page":"1","volume-title":"Proceedings of the 2012 ACM SIGMOD international conference on management of data (SIGMOD\u201912)","author":"A Thomson","year":"2012","unstructured":"Thomson A, Diamond T, Weng SC, Ren K, Shao P, Abadi DJ (2012) Calvin: fast distributed transactions for partitioned database systems. In: Proceedings of the 2012 ACM SIGMOD international conference on management of data (SIGMOD\u201912). ACM, New York, pp 1\u201312. https:\/\/doi.org\/10.1145\/2213836.2213838"},{"key":"177-1_CR23","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/2517349.2522713","volume-title":"Proceedings of the twenty-fourth ACM symposium on operating systems principles (SOSP\u201913)","author":"S Tu","year":"2013","unstructured":"Tu S, Zheng W, Kohler E, Liskov B, Madden S (2013) Speedy transactions in multicore in-memory databases. In: Proceedings of the twenty-fourth ACM symposium on operating systems principles (SOSP\u201913). ACM, New York, pp 18\u201332. https:\/\/doi.org\/10.1145\/2517349.2522713"},{"issue":"2","key":"177-1_CR24","first-page":"49","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. PVLDB 10(2):49\u201360","journal-title":"PVLDB"},{"issue":"4","key":"177-1_CR25","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s00778-017-0463-8","volume":"26","author":"T Wang","year":"2017","unstructured":"Wang T, Johnson R, Fekete A, Pandis I (2017) Efficiently making (almost) any concurrency control mechanism serializable. VLDB J 26(4):537\u2013562. https:\/\/doi.org\/10.1007\/s00778-017-0463-8","journal-title":"VLDB J"},{"issue":"7","key":"177-1_CR26","first-page":"781","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. PVLDB 10(7):781\u2013792","journal-title":"PVLDB"},{"issue":"6","key":"177-1_CR27","first-page":"504","volume":"9","author":"Y Yuan","year":"2016","unstructured":"Yuan Y, Wang K, Lee R, Ding X, Xing J, Blanas S, Zhang X (2016) BCC: reducing false aborts in optimistic concurrency control with low cost for in-memory databases. PVLDB 9(6):504\u2013515","journal-title":"PVLDB"}],"container-title":["Encyclopedia of Big Data Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63962-8_177-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T04:00:33Z","timestamp":1662004833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63962-8_177-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319639628","9783319639628"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63962-8_177-1","relation":{},"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"22 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}