{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:14:36Z","timestamp":1779174876248,"version":"3.51.4"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2014,9]]},"abstract":"<jats:p>\n            When a working set fits into memory, the overhead imposed by the buffer pool renders traditional databases non-competitive with in-memory designs that sacrifice the benefits of a buffer pool. However, despite the large memory available with modern hardware, data skew, shifting workloads, and complex mixed workloads make it difficult to guarantee that a working set will fit in memory. Hence, some recent work has focused on enabling in-memory databases to protect performance when the working data set\n            <jats:italic>almost<\/jats:italic>\n            fits in memory. Contrary to those prior efforts, we enable buffer pool designs to match in-memory performance while supporting the \"big data\" workloads that continue to require secondary storage, thus providing the best of both worlds. We introduce here a novel buffer pool design that adapts pointer swizzling for references between system objects (as opposed to application objects), and uses it to practically eliminate buffer pool overheads for memoryresident data. Our implementation and experimental evaluation demonstrate that we achieve graceful performance degradation when the working set grows to exceed the buffer pool size, and graceful improvement when the working set shrinks towards and below the memory and buffer pool sizes.\n          <\/jats:p>","DOI":"10.14778\/2735461.2735465","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T15:37:52Z","timestamp":1431445072000},"page":"37-48","source":"Crossref","is-referenced-by-count":48,"title":["In-memory performance for big data"],"prefix":"10.14778","volume":"8","author":[{"given":"Goetz","family":"Graefe","sequence":"first","affiliation":[{"name":"HP Labs, Palo Alto"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haris","family":"Volos","sequence":"additional","affiliation":[{"name":"HP Labs, Palo Alto"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideaki","family":"Kimura","sequence":"additional","affiliation":[{"name":"HP Labs, Palo Alto"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harumi","family":"Kuno","sequence":"additional","affiliation":[{"name":"HP Labs, Palo Alto"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Tucek","sequence":"additional","affiliation":[{"name":"HP Labs, Palo Alto"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Lillibridge","sequence":"additional","affiliation":[{"name":"HP Labs, Palo Alto"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alistair","family":"Veitch","sequence":"additional","affiliation":[{"name":"Google"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,9]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"T. Anderson. Microsoft SQL Server 14 man: 'Nothing stops a Hekaton transaction'. http:\/\/www.theregister.co.uk\/2013\/06\/03\/microsoft_sql_server_14_teched\/ 2013.  T. Anderson. Microsoft SQL Server 14 man: 'Nothing stops a Hekaton transaction'. http:\/\/www.theregister.co.uk\/2013\/06\/03\/microsoft_sql_server_14_teched\/ 2013."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380130306"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191915"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556575"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463710"},{"key":"e_1_2_1_6_1","unstructured":"FAL Labs. Tokyo Cabinet: a modern implementation of DBM. http:\/\/fallabs.com\/tokyocabinet\/.  FAL Labs. Tokyo Cabinet: a modern implementation of DBM. http:\/\/fallabs.com\/tokyocabinet\/."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350258"},{"key":"e_1_2_1_8_1","volume-title":"Database system implementation","author":"Garcia-Molina H.","year":"2000","unstructured":"H. Garcia-Molina , J. D. Ullman , and J. Widom . Database system implementation , volume 654 . Prentice Hall Upper Saddle River , NJ , 2000 . H. Garcia-Molina, J. D. Ullman, and J. Widom. Database system implementation, volume 654. Prentice Hall Upper Saddle River, NJ, 2000."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806907.1806908"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000028"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2109196.2109197"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2338626.2338630"},{"key":"e_1_2_1_13_1","unstructured":"SAP HANA. http:\/\/www.saphana.com\/.  SAP HANA. http:\/\/www.saphana.com\/."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376713"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/165854.165907"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516365"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920928"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465271"},{"key":"e_1_2_1_19_1","first-page":"298","volume-title":"Readings in Object-Oriented Database Systems","author":"Kaehler T.","year":"1990","unstructured":"T. Kaehler and G. Krasner . LOOM: Large Object-Oriented Memory for Smalltalk-80 Systems . In S. B. Zdonik and D. Maier, editors, Readings in Object-Oriented Database Systems , pages 298 -- 307 . Kaufmann , San Mateo, CA , 1990 . T. Kaehler and G. Krasner. LOOM: Large Object-Oriented Memory for Smalltalk-80 Systems. In S. B. Zdonik and D. Maier, editors, Readings in Object-Oriented Database Systems, pages 298--307. Kaufmann, San Mateo, CA, 1990."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/645478.654811"},{"key":"e_1_2_1_21_1","first-page":"427","volume-title":"VLDB","author":"Kemper A.","year":"1994","unstructured":"A. Kemper and D. Kossmann . Dual-Buffering Strategies in Object Bases . In VLDB , pages 427 -- 438 , 1994 . A. Kemper and D. Kossmann. Dual-Buffering Strategies in Object Bases. In VLDB, pages 427--438, 1994."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/615224.615230"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-70288-4"},{"key":"e_1_2_1_24_1","first-page":"294","volume-title":"VLDB '86","author":"Lehman T. J.","year":"1986","unstructured":"T. J. Lehman and M. J. Carey . A study of index structures for main memory database management systems. In VLDB , VLDB '86 , pages 294 -- 303 , San Francisco, CA, USA , 1986 . Morgan Kaufmann Publishers Inc. T. J. Lehman and M. J. Carey. A study of index structures for main memory database management systems. In VLDB, VLDB '86, pages 294--303, San Francisco, CA, USA, 1986. Morgan Kaufmann Publishers Inc."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544811"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/645480.655283"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/645480.655433"},{"key":"e_1_2_1_28_1","unstructured":"MonetDB. http:\/\/www.monetdb.org\/.  MonetDB. http:\/\/www.monetdb.org\/."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.153378"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/149439.133084"},{"key":"e_1_2_1_31_1","unstructured":"Oracle TimesTen In-Memory Database. http:\/\/www.oracle.com\/technetwork\/products\/timesten\/overview\/index.html.  Oracle TimesTen In-Memory Database. http:\/\/www.oracle.com\/technetwork\/products\/timesten\/overview\/index.html."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920959"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/2021017.2021019"},{"key":"e_1_2_1_34_1","unstructured":"S. Park. Personal Communication 2013.  S. Park. Personal Communication 2013."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465374"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/320263.320276"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2485278.2485285"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522713"},{"key":"e_1_2_1_39_1","unstructured":"VoltDB. http:\/\/www.voltdb.com.  VoltDB. http:\/\/www.voltdb.com."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/191843.191919"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/122576.122577"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2735461.2735465","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:30:42Z","timestamp":1672223442000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2735461.2735465"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["10.14778\/2735461.2735465"],"URL":"https:\/\/doi.org\/10.14778\/2735461.2735465","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2014,9]]}}}