{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T22:28:00Z","timestamp":1791412080527,"version":"4.3.3"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"U.S. National Science Foundation","award":["IIS-1846158"],"award-info":[{"award-number":["IIS-1846158"]}]},{"name":"U.S. National Science Foundation","award":["IIS-1908984"],"award-info":[{"award-number":["IIS-1908984"]}]},{"name":"U.S. National Science Foundation","award":["IIS-1850342"],"award-info":[{"award-number":["IIS-1850342"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3452819","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:39Z","timestamp":1624036959000},"page":"2195-2207","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory"],"prefix":"10.1145","author":[{"given":"Xinjing","family":"Zhou","sequence":"first","affiliation":[{"name":"Tencent Inc., Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joy","family":"Arulraj","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"Pavlo","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Cohen","sequence":"additional","affiliation":[{"name":"Intel, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"ADMS","author":"Appuswamy R.","year":"2017","unstructured":"R. Appuswamy , R. Borovica , G. Graefe , and A. Ailamaki . The five minute rule thirty years later and its impact on the storage hierarchy . In ADMS , 2017 . R. Appuswamy, R. Borovica, G. Graefe, and A. Ailamaki. The five minute rule thirty years later and its impact on the storage hierarchy. In ADMS, 2017."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749441"},{"key":"e_1_3_2_2_3_1","volume-title":"OSDI","author":"Beaver D.","year":"2010","unstructured":"D. Beaver , S. Kumar , H. C. Li , J. Sobel , P. Vajgel , and F. Inc . Finding a needle in haystack: Facebook's photo storage . In OSDI , 2010 . D. Beaver, S. Kumar, H. C. Li, J. Sobel, P. Vajgel, and F. Inc. Finding a needle in haystack: Facebook's photo storage. In OSDI, 2010."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/17299"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1942776.1942778"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_2_2_7_1","volume-title":"May","author":"Cutress I.","year":"2018","unstructured":"I. Cutress and B. Tallis . Intel launches optane dimms up to 512 gb: Apache pass is here. https:\/\/www.anandtech.com\/show\/12828\/intel-launches-optane-dimms-up-to-512gb-apache-pass-is-here , May 2018 . I. Cutress and B. Tallis. Intel launches optane dimms up to 512 gb: Apache pass is here. https:\/\/www.anandtech.com\/show\/12828\/intel-launches-optane-dimms-up-to-512gb-apache-pass-is-here, May 2018."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1921015"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/971697.602261"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190524"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732967.2732968"},{"key":"e_1_3_2_2_12_1","first-page":"1","volume-title":"FAST","author":"Gill B. S.","year":"2008","unstructured":"B. S. Gill . On multi-level exclusive caching: offline optimality and why promotions are better than demotions . In FAST , pages 1 -- 17 , 2008 . B. S. Gill. On multi-level exclusive caching: offline optimality and why promotions are better than demotions. In FAST, pages 1--17, 2008."},{"key":"e_1_3_2_2_13_1","volume-title":"In-memory performance for big data. VLDB, 8(1)","author":"Graefe G.","year":"2014","unstructured":"G. Graefe , H. Volos , H. Kimura , H. Kuno , J. Tucek , M. Lillibridge , and A. Veitch . In-memory performance for big data. VLDB, 8(1) , 2014 . G. Graefe, H. Volos, H. Kimura, H. Kuno, J. Tucek, M. Lillibridge, and A. Veitch. In-memory performance for big data. VLDB, 8(1), 2014."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191886"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376713"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000002"},{"key":"e_1_3_2_2_17_1","unstructured":"Intel. Thread Building Blocks Library. https:\/\/github.com\/oneapi-src\/oneTBB.  Intel. Thread Building Blocks Library. https:\/\/github.com\/oneapi-src\/oneTBB."},{"key":"e_1_3_2_2_18_1","volume-title":"August","author":"Intel Corporation","year":"2015","unstructured":"Intel Corporation . Intel architecture instruction set extensions programming reference. https:\/\/software.intel.com\/sites\/default\/files\/managed\/07\/b7\/319433-023.pdf , August 2015 . Intel Corporation. Intel architecture instruction set extensions programming reference. https:\/\/software.intel.com\/sites\/default\/files\/managed\/07\/b7\/319433-023.pdf, August 2015."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882905"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2746480"},{"key":"e_1_3_2_2_21_1","volume-title":"Optimization by simulated annealing. science, 220(4598):671--680","author":"Kirkpatrick S.","year":"1983","unstructured":"S. Kirkpatrick , C. D. Gelatt , and M. P. Vecchi . Optimization by simulated annealing. science, 220(4598):671--680 , 1983 . S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. science, 220(4598):671--680, 1983."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132770"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00026"},{"issue":"1","key":"e_1_3_2_2_24_1","first-page":"73","article-title":"Optimistic lock coupling: A scalable and efficient general-purpose synchronization method","volume":"42","author":"Leis V.","year":"2019","unstructured":"V. Leis , M. Haubenschild , and T. Neumann . Optimistic lock coupling: A scalable and efficient general-purpose synchronization method . IEEE Data Eng. Bull. , 42 ( 1 ): 73 -- 84 , 2019 . V. Leis, M. Haubenschild, and T. Neumann. Optimistic lock coupling: A scalable and efficient general-purpose synchronization method. IEEE Data Eng. Bull., 42(1):73--84, 2019.","journal-title":"IEEE Data Eng. Bull."},{"issue":"4","key":"e_1_3_2_2_25_1","first-page":"574","article-title":"Evaluating persistent memory range indexes","volume":"13","author":"Lersch L.","year":"2019","unstructured":"L. Lersch , X. Hao , I. Oukid , T. Wang , and T. Willhalm . Evaluating persistent memory range indexes . VLDB , 13 ( 4 ): 574 -- 587 , 2019 . L. Lersch, X. Hao, I. Oukid, T. Wang, and T. Willhalm. Evaluating persistent memory range indexes. VLDB, 13(4):574--587, 2019.","journal-title":"VLDB"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66917-5_22"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544811"},{"key":"e_1_3_2_2_28_1","first-page":"1","volume-title":"DaMoN","author":"Lomet D.","year":"2018","unstructured":"D. Lomet . Cost\/performance in modern data stores: How data caching systems succeed . In DaMoN , pages 1 -- 10 , 2018 . D. Lomet. Cost\/performance in modern data stores: How data caching systems succeed. In DaMoN, pages 1--10, 2018."},{"key":"e_1_3_2_2_29_1","volume-title":"DaMoN","author":"Ma L.","year":"2016","unstructured":"L. Ma and et al. Larger-than-memory data management on modern storage hardware for in-memory oltp database systems . In DaMoN , 2016 . L. Ma and et al. Larger-than-memory data management on modern storage hardware for in-memory oltp database systems. In DaMoN, 2016."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/128765.128770"},{"key":"e_1_3_2_2_31_1","first-page":"1","volume-title":"DaMoN","author":"Oukid I.","year":"2014","unstructured":"I. Oukid , D. Booss , W. Lehner , P. Bumbulis , and T. Willhalm . SOFORT: A hybrid SCM-DRAM storage engine for fast data recovery . DaMoN , pages 8: 1 -- 8 :7, 2014 . I. Oukid, D. Booss, W. Lehner, P. Bumbulis, and T. Willhalm. SOFORT: A hybrid SCM-DRAM storage engine for fast data recovery. DaMoN, pages 8:1--8:7, 2014."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3329785.3329917"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213946"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/320263.320276"},{"key":"e_1_3_2_2_35_1","volume-title":"June","author":"The Transaction Processing Council","year":"2007","unstructured":"The Transaction Processing Council . TPC-C Benchmark (Revision 5.9.0). http:\/\/www.tpc.org\/tpcc\/ , June 2007 . The Transaction Processing Council. TPC-C Benchmark (Revision 5.9.0). http:\/\/www.tpc.org\/tpcc\/, June 2007."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3329785.3329930"},{"key":"e_1_3_2_2_37_1","volume-title":"SIGMOD","author":"A.","year":"2018","unstructured":"A. van Renen et. al. Managing non-volatile memory in database systems . In SIGMOD , 2018 . A. van Renen et. al. Managing non-volatile memory in database systems. In SIGMOD, 2018."},{"key":"e_1_3_2_2_38_1","first-page":"307","volume-title":"19th $$USENIX$$ Conference on File and Storage Technologies ($$FAST$$ 21)","author":"Wu K.","year":"2021","unstructured":"K. Wu , Z. Guo , G. Hu , K. Tu , R. Alagappan , R. Sen , K. Park , A. C. Arpaci-Dusseau , and R. H. Arpaci-Dusseau . The storage hierarchy is not a hierarchy: Optimizing caching on modern storage devices with orthus . In 19th $$USENIX$$ Conference on File and Storage Technologies ($$FAST$$ 21) , pages 307 -- 323 , 2021 . K. Wu, Z. Guo, G. Hu, K. Tu, R. Alagappan, R. Sen, K. Park, A. C. Arpaci-Dusseau, and R. H. Arpaci-Dusseau. The storage hierarchy is not a hierarchy: Optimizing caching on modern storage devices with orthus. In 19th $$USENIX$$ Conference on File and Storage Technologies ($$FAST$$ 21), pages 307--323, 2021."},{"issue":"7","key":"e_1_3_2_2_39_1","first-page":"781","article-title":"An empirical evaluation of in-memory multi-version concurrency control","volume":"10","author":"Wu Y.","year":"2017","unstructured":"Y. Wu , J. Arulraj , J. Lin , R. Xian , and A. Pavlo . An empirical evaluation of in-memory multi-version concurrency control . VLDB , 10 ( 7 ): 781 -- 792 , 2017 . Y. Wu, J. Arulraj, J. Lin, R. Xian, and A. Pavlo. An empirical evaluation of in-memory multi-version concurrency control. VLDB, 10(7):781--792, 2017.","journal-title":"VLDB"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447872"}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3452819","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3452819","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:28:05Z","timestamp":1750195685000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3452819"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":40,"alternative-id":["10.1145\/3448016.3452819","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3452819","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}