{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T11:24:50Z","timestamp":1747826690841},"reference-count":16,"publisher":"Association for Computing Machinery (ACM)","issue":"13","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2016,9]]},"abstract":"<jats:p>This tutorial provides an overview of recent developments in main-memory database systems. With growing memory sizes and memory prices dropping by a factor of 10 every 5 years, data having a \"primary home\" in memory is now a reality. Main-memory databases eschew many of the traditional architectural tenets of relational database systems that optimized for disk-resident data. Innovative approaches to fundamental issues such as concurrency control and query processing are required to unleash the full performance potential of main-memory databases. The tutorial is focused around design issues and architectural choices that must be made when building a high performance database system optimized for main-memory: data storage and indexing, concurrency control, durability and recovery techniques, query processing and compilation, support for high availability, and ability to support hybrid transactional and analytics workloads. This will be illustrated by example solutions drawn from four state-of-the-art systems: H-Store\/VoltDB, Hekaton, HyPeR, and SAP HANA. The tutorial will also cover current and future research trends.<\/jats:p>","DOI":"10.14778\/3007263.3007321","type":"journal-article","created":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T09:47:47Z","timestamp":1477993667000},"page":"1609-1610","source":"Crossref","is-referenced-by-count":16,"title":["Modern main-memory database systems"],"prefix":"10.14778","volume":"9","author":[{"given":"Per-\u00c5ke","family":"Larson","sequence":"first","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Levandoski","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,9]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"1033","volume-title":"VLDB","author":"Cha S. K.","year":"2004","unstructured":"S. K. Cha and C. Song . P*TIME: Highly Scalable OLTP DBMS for Managing Update-Intensive Stream Workload . In VLDB , pages 1033 -- 1044 , 2004 . S. K. Cha and C. Song. P*TIME: Highly Scalable OLTP DBMS for Managing Update-Intensive Stream Workload. In VLDB, pages 1033--1044, 2004."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463710"},{"issue":"1","key":"e_1_2_1_3_1","first-page":"22","volume":"37","author":"Freedman C.","year":"2014","unstructured":"C. Freedman , E. Ismert , and P. Larson . Compilation in the Microsoft SQL Server Hekaton Engine. IEEE Data Engineering Bulletin , 37 ( 1 ): 22 -- 30 , 2014 . C. Freedman, E. Ismert, and P. Larson. Compilation in the Microsoft SQL Server Hekaton Engine. IEEE Data Engineering Bulletin, 37(1):22--30, 2014.","journal-title":"Compilation in the Microsoft SQL Server Hekaton Engine. IEEE Data Engineering Bulletin"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454211"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767867"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824071"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2095686.2095689"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/16894.16878"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544812"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544834"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816685"},{"key":"e_1_2_1_12_1","author":"M\u00fchlbauer T.","year":"2013","unstructured":"T. M\u00fchlbauer , W. R\u00f6diger , A. Reiser , A. Kemper , and T. Neumann . ScyPer: Elastic OLAP Throughput on Transactional Data. In DanaC , 2013 . T. M\u00fchlbauer, W. R\u00f6diger, A. Reiser, A. Kemper, and T. Neumann. ScyPer: Elastic OLAP Throughput on Transactional Data. In DanaC, 2013.","journal-title":"ScyPer: Elastic OLAP Throughput on Transactional Data. In DanaC"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002938.2002940"},{"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\/2213836.2213946"},{"key":"e_1_2_1_16_1","volume-title":"The VoltDB Main Memory DBMS","author":"Stonebraker M.","year":"2013","unstructured":"M. Stonebraker and A. Weisberg . The VoltDB Main Memory DBMS . IEEE Data Engineering Bulletin , 36(2):21--27, 2013 . M. Stonebraker and A. Weisberg. The VoltDB Main Memory DBMS. IEEE Data Engineering Bulletin, 36(2):21--27, 2013."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3007263.3007321","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T04:35:33Z","timestamp":1672202133000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3007263.3007321"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":16,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["10.14778\/3007263.3007321"],"URL":"https:\/\/doi.org\/10.14778\/3007263.3007321","relation":{},"ISSN":["2150-8097"],"issn-type":[{"type":"print","value":"2150-8097"}],"subject":[],"published":{"date-parts":[[2016,9]]}}}