{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T02:49:37Z","timestamp":1783738177334,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T00:00:00Z","timestamp":1527379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,27]]},"DOI":"10.1145\/3183713.3196897","type":"proceedings-article","created":{"date-parts":[[2018,5,25]],"date-time":"2018-05-25T12:39:28Z","timestamp":1527251968000},"page":"1541-1555","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":92,"title":["Managing Non-Volatile Memory in Database Systems"],"prefix":"10.1145","author":[{"given":"Alexander","family":"van Renen","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Viktor","family":"Leis","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfons","family":"Kemper","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Neumann","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takushi","family":"Hashida","sequence":"additional","affiliation":[{"name":"Fujitsu Laboratories, Kawasaki, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kazuichi","family":"Oe","sequence":"additional","affiliation":[{"name":"Fujitsu Laboratories, Kawasaki, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yoshiyasu","family":"Doi","sequence":"additional","affiliation":[{"name":"Fujitsu Laboratories, Kawasaki, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lilian","family":"Harada","sequence":"additional","affiliation":[{"name":"Fujitsu Laboratories, Kawasaki, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mitsuru","family":"Sato","sequence":"additional","affiliation":[{"name":"Fujitsu Laboratories, Kawasaki, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Persistent memory programming. http:\/\/www.pmem.io. Accessed: 2018-02--13.  Persistent memory programming. http:\/\/www.pmem.io. Accessed: 2018-02--13."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137780"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3164135.3164147"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749441"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/3025111.3025116"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1734663.1734671"},{"key":"e_1_3_2_1_7_1","volume-title":"CIDR","author":"Bonnet P.","year":"2017","unstructured":"P. Bonnet . What's up with the storage hierarchy ? In CIDR , 2017 . P. Bonnet. What's up with the storage hierarchy? In CIDR, 2017."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1921017"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735483"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752947"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989442"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2901318.2901344"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592814"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732967.2732968"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767918"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735461.2735465"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/38713.38755"},{"key":"e_1_3_2_1_19_1","volume-title":"Morgan Kaufmann","author":"Gray J.","year":"1993","unstructured":"J. Gray and A. Reuter . Transaction Processing: Concepts and Techniques . Morgan Kaufmann , 1993 . J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, 1993."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191886"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376713"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735496.2735502"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0414-1"},{"key":"e_1_3_2_1_24_1","volume-title":"HPCA","author":"Karnagel T.","year":"2014","unstructured":"T. Karnagel , R. Dementiev , R. Rajwar , K. Lai , T. Legler , B. Schlegel , and W. Lehner . Improving in-memory database index performance with intel transactional synchronization extensions . In HPCA , 2014 . T. Karnagel, R. Dementiev, R. Rajwar, K. Lai, T. Legler, B. Schlegel, and W. Lehner. Improving in-memory database index performance with intel transactional synchronization extensions. In HPCA, 2014."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2746480"},{"key":"e_1_3_2_1_26_1","first-page":"257","volume-title":"FAST","author":"Lee S. K.","year":"2017","unstructured":"S. K. Lee , K. H. Lim , H. Song , B. Nam , and S. H. Noh . WORT: write optimal radix tree for persistent memory storage systems . In FAST , pages 257 -- 270 , 2017 . S. K. Lee, K. H. Lim, H. Song, B. Nam, and S. H. Noh. WORT: write optimal radix tree for persistent memory storage systems. In FAST, pages 257--270, 2017."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00026"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2411272"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933349.2933352"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3076113.3076123"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544811"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536354.2536355"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336679"},{"key":"e_1_3_2_1_34_1","volume-title":"FAST","author":"Megiddo N.","year":"2003","unstructured":"N. Megiddo and D. S. Modha . ARC: a self-tuning, low overhead replacement cache . In FAST , 2003 . N. Megiddo and D. S. Modha. ARC: a self-tuning, low overhead replacement cache. In FAST, 2003."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2442980"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619228.2619236"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933349.2933354"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137629"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915251"},{"key":"e_1_3_2_1_40_1","volume-title":"CIDR","author":"Oukid I.","year":"2015","unstructured":"I. Oukid , W. Lehner , T. Kissinger , T. Willhalm , and P. Bumbulis . Instant recovery for main memory databases . In CIDR , 2015 . I. Oukid, W. Lehner, T. Kissinger, T. Willhalm, and P. Bumbulis. Instant recovery for main memory databases. In CIDR, 2015."},{"key":"e_1_3_2_1_41_1","unstructured":"M. Stonebraker. How hardware drives the shape of databases to come. https:\/\/www.nextplatform.com\/2017\/08\/15\/hardware-drives-shape-databases-come\/. Accessed: 2017--11-02.  M. Stonebraker. How hardware drives the shape of databases to come. https:\/\/www.nextplatform.com\/2017\/08\/15\/hardware-drives-shape-databases-come\/. Accessed: 2017--11-02."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522713"},{"key":"e_1_3_2_1_43_1","first-page":"61","volume-title":"FAST","author":"Venkataraman S.","year":"2011","unstructured":"S. Venkataraman , N. Tolia , P. Ranganathan , and R. H. Campbell . Consistent and durable data structures for non-volatile byte-addressable memory . In FAST , pages 61 -- 75 , 2011 . S. Venkataraman, N. Tolia, P. Ranganathan, and R. H. Campbell. Consistent and durable data structures for non-volatile byte-addressable memory. In FAST, pages 61--75, 2011."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732277"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732951.2732960"},{"key":"e_1_3_2_1_46_1","first-page":"349","volume-title":"USENIX ATC","author":"Xia F.","year":"2017","unstructured":"F. Xia , D. Jiang , J. Xiong , and N. Sun . Hikv: A hybrid index key-value store for DRAM-NVM memory systems . In USENIX ATC , pages 349 -- 362 , 2017 . F. Xia, D. Jiang, J. Xiong, and N. Sun. Hikv: A hybrid index key-value store for DRAM-NVM memory systems. In USENIX ATC, pages 349--362, 2017."},{"key":"e_1_3_2_1_47_1","first-page":"167","volume-title":"FAST","author":"Yang J.","year":"2015","unstructured":"J. Yang , Q. Wei , C. Chen , C. Wang , K. L. Yong , and B. He . NV-Tree: Reducing consistency cost for NVM-based single level systems . In FAST , pages 167 -- 181 , 2015 . J. Yang, Q. Wei, C. Chen, C. Wang, K. L. Yong, and B. He. NV-Tree: Reducing consistency cost for NVM-based single level systems. In FAST, pages 167--181, 2015."}],"event":{"name":"SIGMOD\/PODS '18: International Conference on Management of Data","location":"Houston TX USA","acronym":"SIGMOD\/PODS '18","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2018 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196897","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3183713.3196897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:18Z","timestamp":1750210758000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3183713.3196897"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,27]]},"references-count":47,"alternative-id":["10.1145\/3183713.3196897","10.1145\/3183713"],"URL":"https:\/\/doi.org\/10.1145\/3183713.3196897","relation":{},"subject":[],"published":{"date-parts":[[2018,5,27]]},"assertion":[{"value":"2018-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}