{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T06:31:44Z","timestamp":1787207504934,"version":"build-2736575974"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>Persistent memory (PMem) promised DRAM-like performance, byte addressability, and the persistency guarantees of conventional block storage. With the release of Intel Optane DCPMM, those expectations were dampened. While its write latency competes with DRAM, its read latency, write endurance, and especially bandwidth fall behind by up to an order of magnitude.<\/jats:p>\n                  <jats:p>Established PMem index structures mostly focus on lookups and cannot leverage PMem's low write latency. For inserts, DRAM-optimized index structures are still an order of magnitude faster than their PMem counterparts despite the similar write latency. We identify the combination of PMem's low write bandwidth and the existing solutions' high media write amplification as the culprit.<\/jats:p>\n                  <jats:p>We present Plush, a write-optimized, hybrid hash table for PMem with support for variable-length keys and values. It minimizes media write and read amplification while exploiting PMem's unique advantages, namely its low write latency and full bandwidth even for small reads and writes. On a 24-core server with 768 GB of Intel Optane DPCMM, Plush outperforms state-of-the-art PMem-optimized hash tables by up to 2.44X for inserts while only using a tiny amount of DRAM. It achieves this speedup by reducing write amplification by 80%. For lookups, its throughput is similar to that of established PMem-optimized tree-like index structures.<\/jats:p>","DOI":"10.14778\/3551793.3551839","type":"journal-article","created":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T18:25:03Z","timestamp":1664475903000},"page":"2895-2907","source":"Crossref","is-referenced-by-count":25,"title":["Plush"],"prefix":"10.14778","volume":"15","author":[{"given":"Lukas","family":"Vogel","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"van Renen","sequence":"additional","affiliation":[{"name":"FAU Erlangen-N\u00fcrnberg"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Satoshi","family":"Imamura","sequence":"additional","affiliation":[{"name":"Fujitsu Limited"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jana","family":"Giceva","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Neumann","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfons","family":"Kemper","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,9,29]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"553","article-title":"BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory","volume":"11","author":"Arulraj Joy","year":"2018","unstructured":"Joy Arulraj , Justin J. Levandoski , Umar Farooq Minhas , and Per-\u00c5ke Larson . 2018 . BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory . PVLDB 11 , 5 (2018), 553 -- 565 . Joy Arulraj, Justin J. Levandoski, Umar Farooq Minhas, and Per-\u00c5ke Larson. 2018. BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory. PVLDB 11, 5 (2018), 553--565.","journal-title":"PVLDB"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Berk Atikoglu Yuehai Xu Eitan Frachtenberg Song Jiang and Mike Paleczny. 2012. Workload analysis of a large-scale key-value store. In SIGMETRICS. ACM 53--64.  Berk Atikoglu Yuehai Xu Eitan Frachtenberg Song Jiang and Mike Paleczny. 2012. Workload analysis of a large-scale key-value store. In SIGMETRICS. ACM 53--64.","DOI":"10.1145\/2318857.2254766"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461543"},{"key":"e_1_2_1_4_1","first-page":"1","article-title":"Drop It In Like It's Hot: An Analysis of Persistent Memory as a Drop-in Replacement for NVMe SSDs","volume":"7","author":"B\u00f6ther Maximilian","year":"2021","unstructured":"Maximilian B\u00f6ther , Otto Ki\u00dfig , Lawrence Benson , and Tilmann Rabl . 2021 . Drop It In Like It's Hot: An Analysis of Persistent Memory as a Drop-in Replacement for NVMe SSDs . In DaMoN. ACM , 7 : 1 -- 7 :8. Maximilian B\u00f6ther, Otto Ki\u00dfig, Lawrence Benson, and Tilmann Rabl. 2021. Drop It In Like It's Hot: An Analysis of Persistent Memory as a Drop-in Replacement for NVMe SSDs. In DaMoN. ACM, 7:1--7:8.","journal-title":"DaMoN. ACM"},{"key":"e_1_2_1_5_1","first-page":"1","article-title":"Scalable and robust latches for database systems","volume":"2","author":"B\u00f6ttcher Jan","year":"2020","unstructured":"Jan B\u00f6ttcher , Viktor Leis , Jana Giceva , Thomas Neumann , and Alfons Kemper . 2020 . Scalable and robust latches for database systems . In DaMoN. ACM , 2 : 1 -- 2 :8. Jan B\u00f6ttcher, Viktor Leis, Jana Giceva, Thomas Neumann, and Alfons Kemper. 2020. Scalable and robust latches for database systems. In DaMoN. ACM, 2:1--2:8.","journal-title":"DaMoN. ACM"},{"key":"e_1_2_1_6_1","volume-title":"USENIX Annual Technical Conference. USENIX Association, 1007--1019","author":"Chan Helen H. W.","year":"2018","unstructured":"Helen H. W. Chan , Yongkun Li , Patrick P. C. Lee , and Yinlong Xu . 2018 . HashKV: Enabling Efficient Updates in KV Storage via Hashing . In USENIX Annual Technical Conference. USENIX Association, 1007--1019 . Helen H. W. Chan, Yongkun Li, Patrick P. C. Lee, and Yinlong Xu. 2018. HashKV: Enabling Efficient Updates in KV Storage via Hashing. In USENIX Annual Technical Conference. USENIX Association, 1007--1019."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196898"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752947"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407850"},{"key":"e_1_2_1_10_1","volume-title":"HotStorage","author":"Choi Jungsik","unstructured":"Jungsik Choi , Jiwon Kim , and Hwansoo Han . 2017. Efficient Memory Mapped File I\/O for In-Memory File Systems . In HotStorage . USENIX Association . Jungsik Choi, Jiwon Kim, and Hwansoo Han. 2017. Efficient Memory Mapped File I\/O for In-Memory File Systems. In HotStorage. USENIX Association."},{"key":"e_1_2_1_11_1","volume-title":"Maximizing Persistent Memory Bandwidth Utilization for OLAP Workloads. In SIGMOD Conference. ACM, 339--351","author":"Daase Bj\u00f6rn","year":"2021","unstructured":"Bj\u00f6rn Daase , Lars Jonas Bollmeier , Lawrence Benson , and Tilmann Rabl . 2021 . Maximizing Persistent Memory Bandwidth Utilization for OLAP Workloads. In SIGMOD Conference. ACM, 339--351 . Bj\u00f6rn Daase, Lars Jonas Bollmeier, Lawrence Benson, and Tilmann Rabl. 2021. Maximizing Persistent Memory Bandwidth Utilization for OLAP Workloads. In SIGMOD Conference. ACM, 339--351."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/320083.320092"},{"key":"e_1_2_1_13_1","unstructured":"Sanjay Ghemawat and Jeff Dean. 2011. LevelDB. Retrieved 2022-07-13 from https:\/\/github.com\/google\/leveldb  Sanjay Ghemawat and Jeff Dean. 2011. LevelDB. Retrieved 2022-07-13 from https:\/\/github.com\/google\/leveldb"},{"key":"e_1_2_1_14_1","volume-title":"Weinberger","author":"Gray Jim","year":"1994","unstructured":"Jim Gray , Prakash Sundaresan , Susanne Englert , Kenneth Baclawski , and Peter J . Weinberger . 1994 . Quickly Generating Billion-Record Synthetic Databases. In SIGMOD Conference. ACM Press , 243--252. Jim Gray, Prakash Sundaresan, Susanne Englert, Kenneth Baclawski, and Peter J. Weinberger. 1994. Quickly Generating Billion-Record Synthetic Databases. In SIGMOD Conference. ACM Press, 243--252."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3436905.3436921"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389716"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3446095.3446101"},{"key":"e_1_2_1_18_1","first-page":"1","article-title":"Parallel Multi-split Extendible Hashing for Persistent Memory","volume":"48","author":"Hu Jing","year":"2021","unstructured":"Jing Hu , Jianxi Chen , Yifeng Zhu , Qing Yang , Zhouxuan Peng , and Ya Yu . 2021 . Parallel Multi-split Extendible Hashing for Persistent Memory . In ICPP. ACM , 48 : 1 -- 48 :10. Jing Hu, Jianxi Chen, Yifeng Zhu, Qing Yang, Zhouxuan Peng, and Ya Yu. 2021. Parallel Multi-split Extendible Hashing for Persistent Memory. In ICPP. ACM, 48:1--48:10.","journal-title":"ICPP. ACM"},{"key":"e_1_2_1_19_1","volume-title":"DASFAA (3) (Lecture Notes in Computer Science)","author":"Huang Chenchen","unstructured":"Chenchen Huang , Huiqi Hu , and Aoying Zhou . 2021. BPTree: An Optimized Index with Batch Persistence on Optane DC PM . In DASFAA (3) (Lecture Notes in Computer Science) , Vol. 12683 . Springer , 478--486. Chenchen Huang, Huiqi Hu, and Aoying Zhou. 2021. BPTree: An Optimized Index with Batch Persistence on Optane DC PM. In DASFAA (3) (Lecture Notes in Computer Science), Vol. 12683. Springer, 478--486."},{"key":"e_1_2_1_20_1","volume-title":"11th Conference on Innovative Data Systems Research, CIDR","author":"Huang Kaisong","year":"2022","unstructured":"Kaisong Huang , Darien Imai , Tianzheng Wang , and Dong Xie . 2022. SSDs Striking Back: The Storage Jungle and Its Implications on Persistent Indexes . In 11th Conference on Innovative Data Systems Research, CIDR 2022 , Chaminade, California, January 9--12, 2022, Online Proceedings . www.cidrdb.org. http:\/\/cidrdb.org\/cidr2022\/papers\/p64-huang.pdf Kaisong Huang, Darien Imai, Tianzheng Wang, and Dong Xie. 2022. SSDs Striking Back: The Storage Jungle and Its Implications on Persistent Indexes. In 11th Conference on Innovative Data Systems Research, CIDR 2022, Chaminade, California, January 9--12, 2022, Online Proceedings. www.cidrdb.org. http:\/\/cidrdb.org\/cidr2022\/papers\/p64-huang.pdf"},{"key":"e_1_2_1_21_1","volume-title":"Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree","author":"Hwang Deukyeon","unstructured":"Deukyeon Hwang , Wook-Hee Kim , Youjip Won , and Beomseok Nam . 2018. Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree . In FAST. USENIX Association , 187--200. Deukyeon Hwang, Wook-Hee Kim, Youjip Won, and Beomseok Nam. 2018. Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree. In FAST. USENIX Association, 187--200."},{"key":"e_1_2_1_22_1","unstructured":"Intel. 2022. Intel Optane DC persistent Memory Data sheet. Retrieved 2022-07-13 from https:\/\/www.intel.de\/content\/dam\/www\/public\/us\/en\/documents\/product-briefs\/optane-dc-persistent-memory-brief.pdf  Intel. 2022. Intel Optane DC persistent Memory Data sheet. Retrieved 2022-07-13 from https:\/\/www.intel.de\/content\/dam\/www\/public\/us\/en\/documents\/product-briefs\/optane-dc-persistent-memory-brief.pdf"},{"key":"e_1_2_1_23_1","volume-title":"Yun Joon Soh, Zixuan Wang, Yi Xu, Subramanya R. Dulloor, Jishen Zhao, and Steven Swanson.","author":"Izraelevitz Joseph","year":"2019","unstructured":"Joseph Izraelevitz , Jian Yang , Lu Zhang , Juno Kim , Xiao Liu , Amir Saman Memaripour , Yun Joon Soh, Zixuan Wang, Yi Xu, Subramanya R. Dulloor, Jishen Zhao, and Steven Swanson. 2019 . Basic Performance Measurements of the Intel Optane DC Persistent Memory Module. CoRR abs\/1903.05714 (2019). Joseph Izraelevitz, Jian Yang, Lu Zhang, Juno Kim, Xiao Liu, Amir Saman Memaripour, Yun Joon Soh, Zixuan Wang, Yi Xu, Subramanya R. Dulloor, Jishen Zhao, and Steven Swanson. 2019. Basic Performance Measurements of the Intel Optane DC Persistent Memory Module. CoRR abs\/1903.05714 (2019)."},{"key":"e_1_2_1_24_1","volume-title":"SLM-DB: Single-Level Key-Value Store with Persistent Memory","author":"Kaiyrakhmet Olzhas","unstructured":"Olzhas Kaiyrakhmet , Songyi Lee , Beomseok Nam , Sam H. Noh , and Young-ri Choi. 2019. SLM-DB: Single-Level Key-Value Store with Persistent Memory . In FAST. USENIX Association , 191--205. Olzhas Kaiyrakhmet, Songyi Lee, Beomseok Nam, Sam H. Noh, and Young-ri Choi. 2019. SLM-DB: Single-Level Key-Value Store with Persistent Memory. In FAST. USENIX Association, 191--205."},{"key":"e_1_2_1_25_1","volume-title":"Redesigning LSMs for Nonvolatile Memory with NoveLSM. In USENIX Annual Technical Conference. USENIX Association, 993--1005","author":"Kannan Sudarsun","unstructured":"Sudarsun Kannan , Nitish Bhat , Ada Gavrilovska , Andrea C. Arpaci-Dusseau , and Remzi H . Arpaci-Dusseau. 2018 . Redesigning LSMs for Nonvolatile Memory with NoveLSM. In USENIX Annual Technical Conference. USENIX Association, 993--1005 . Sudarsun Kannan, Nitish Bhat, Ada Gavrilovska, Andrea C. Arpaci-Dusseau, and Remzi H. Arpaci-Dusseau. 2018. Redesigning LSMs for Nonvolatile Memory with NoveLSM. In USENIX Annual Technical Conference. USENIX Association, 993--1005."},{"key":"e_1_2_1_26_1","first-page":"73","article-title":"Optimistic Lock Coupling: A Scalable and Efficient General-Purpose Synchronization Method","volume":"42","author":"Leis Viktor","year":"2019","unstructured":"Viktor Leis , Michael Haubenschild , and Thomas Neumann . 2019 . Optimistic Lock Coupling: A Scalable and Efficient General-Purpose Synchronization Method . IEEE Data Eng. Bull. 42 , 1 (2019), 73 -- 84 . Viktor Leis, Michael Haubenschild, and Thomas Neumann. 2019. Optimistic Lock Coupling: A Scalable and Efficient General-Purpose Synchronization Method. IEEE Data Eng. Bull. 42, 1 (2019), 73--84.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372728"},{"key":"e_1_2_1_28_1","first-page":"1","article-title":"Persistent Buffer Management with Optimistic Consistency","volume":"14","author":"Lersch Lucas","year":"2019","unstructured":"Lucas Lersch , Wolfgang Lehner , and Ismail Oukid . 2019 . Persistent Buffer Management with Optimistic Consistency . In DaMoN. ACM , 14 : 1 -- 14 :3. Lucas Lersch, Wolfgang Lehner, and Ismail Oukid. 2019. Persistent Buffer Management with Optimistic Consistency. In DaMoN. ACM, 14:1--14:3.","journal-title":"DaMoN. ACM"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-020-0780-z"},{"key":"e_1_2_1_30_1","first-page":"916","article-title":"LibreKV: A Persistent in-Memory Key-Value Store","volume":"8","author":"Liu Hao","year":"2020","unstructured":"Hao Liu , Linpeng Huang , Yanmin Zhu , and Yanyan Shen . 2020 . LibreKV: A Persistent in-Memory Key-Value Store . IEEE Trans. Emerg. Top. Comput. 8 , 4 (2020), 916 -- 927 . Hao Liu, Linpeng Huang, Yanmin Zhu, and Yanyan Shen. 2020. LibreKV: A Persistent in-Memory Key-Value Store. IEEE Trans. Emerg. Top. Comput. 8, 4 (2020), 916--927.","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384355"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389134"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033273"},{"key":"e_1_2_1_34_1","volume-title":"ROART","author":"Ma Shaonan","year":"2021","unstructured":"Shaonan Ma , Kang Chen , Shimin Chen , Mengxing Liu , Jianglang Zhu , Hongbo Kang , and Yongwei Wu . 2021 . ROART : Range-query Optimized Persistent ART. In FAST. USENIX Association , 1--16. Shaonan Ma, Kang Chen, Shimin Chen, Mengxing Liu, Jianglang Zhu, Hongbo Kang, and Yongwei Wu. 2021. ROART: Range-query Optimized Persistent ART. In FAST. USENIX Association, 1--16."},{"key":"e_1_2_1_35_1","volume-title":"Write-Optimized Dynamic Hashing for Persistent Memory","author":"Nam Moohyeon","unstructured":"Moohyeon Nam , Hokeun Cha , Young-ri Choi, Sam H. Noh , and Beomseok Nam . 2019. Write-Optimized Dynamic Hashing for Persistent Memory . In FAST. USENIX Association , 31--44. Moohyeon Nam, Hokeun Cha, Young-ri Choi, Sam H. Noh, and Beomseok Nam. 2019. Write-Optimized Dynamic Hashing for Persistent Memory. In FAST. USENIX Association, 31--44."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915251"},{"key":"e_1_2_1_38_1","volume-title":"hash-, and space-efficient bloom filters. ACM J. Exp. Algorithmics 14","author":"Putze Felix","year":"2009","unstructured":"Felix Putze , Peter Sanders , and Johannes Singler . 2009. Cache- , hash-, and space-efficient bloom filters. ACM J. Exp. Algorithmics 14 ( 2009 ). Felix Putze, Peter Sanders, and Johannes Singler. 2009. Cache-, hash-, and space-efficient bloom filters. ACM J. Exp. Algorithmics 14 (2009)."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476286"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213862"},{"key":"e_1_2_1_41_1","volume-title":"Managing Non-Volatile Memory in Database Systems. In SIGMOD Conference. ACM, 1541--1555","author":"van Renen Alexander","year":"2018","unstructured":"Alexander van Renen , Viktor Leis , Alfons Kemper , Thomas Neumann , Takushi Hashida , Kazuichi Oe , Yoshiyasu Doi , Lilian Harada , and Mitsuru Sato . 2018 . Managing Non-Volatile Memory in Database Systems. In SIGMOD Conference. ACM, 1541--1555 . Alexander van Renen, Viktor Leis, Alfons Kemper, Thomas Neumann, Takushi Hashida, Kazuichi Oe, Yoshiyasu Doi, Lilian Harada, and Mitsuru Sato. 2018. Managing Non-Volatile Memory in Database Systems. In SIGMOD Conference. ACM, 1541--1555."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00622-9"},{"key":"e_1_2_1_43_1","volume-title":"Andres Jaan Tack, and Michael M. Swift","author":"Volos Haris","year":"2011","unstructured":"Haris Volos , Andres Jaan Tack, and Michael M. Swift . 2011 . Mnemosyne: lightweight persistent memory. In ASPLOS. ACM , 91--104. Haris Volos, Andres Jaan Tack, and Michael M. Swift. 2011. Mnemosyne: lightweight persistent memory. In ASPLOS. ACM, 91--104."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3136459"},{"key":"e_1_2_1_45_1","volume-title":"Parallax: Hybrid Key-Value Placement in LSM-based Key-Value Stores. In SoCC. ACM, 305--318.","author":"Xanthakis Giorgos","year":"2021","unstructured":"Giorgos Xanthakis , Giorgos Saloustros , Nikos Batsaras , Anastasios Papagiannis , and Angelos Bilas . 2021 . Parallax: Hybrid Key-Value Placement in LSM-based Key-Value Stores. In SoCC. ACM, 305--318. Giorgos Xanthakis, Giorgos Saloustros, Nikos Batsaras, Anastasios Papagiannis, and Angelos Bilas. 2021. Parallax: Hybrid Key-Value Placement in LSM-based Key-Value Stores. In SoCC. ACM, 305--318."},{"key":"e_1_2_1_46_1","volume-title":"HiKV: A Hybrid Index Key-Value Store for DRAM-NVM Memory Systems. In USENIX Annual Technical Conference. USENIX Association, 349--362","author":"Xia Fei","year":"2017","unstructured":"Fei Xia , Dejun Jiang , Jin Xiong , and Ninghui Sun . 2017 . HiKV: A Hybrid Index Key-Value Store for DRAM-NVM Memory Systems. In USENIX Annual Technical Conference. USENIX Association, 349--362 . Fei Xia, Dejun Jiang, Jin Xiong, and Ninghui Sun. 2017. HiKV: A Hybrid Index Key-Value Store for DRAM-NVM Memory Systems. In USENIX Annual Technical Conference. USENIX Association, 349--362."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3077898"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/3467861.3467875"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2479621"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453300"},{"key":"e_1_2_1_51_1","volume-title":"Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory. In SIGMOD Conference. ACM, 2195--2207","author":"Zhou Xinjing","year":"2021","unstructured":"Xinjing Zhou , Joy Arulraj , Andrew Pavlo , and David Cohen . 2021 . Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory. In SIGMOD Conference. ACM, 2195--2207 . Xinjing Zhou, Joy Arulraj, Andrew Pavlo, and David Cohen. 2021. Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory. In SIGMOD Conference. ACM, 2195--2207."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372717"},{"key":"e_1_2_1_53_1","volume-title":"Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory","author":"Zuo Pengfei","unstructured":"Pengfei Zuo , Yu Hua , and Jie Wu. 2018. Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory . In OSDI. USENIX Association , 461--476. Pengfei Zuo, Yu Hua, and Jie Wu. 2018. Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory. In OSDI. USENIX Association, 461--476."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3551793.3551839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T05:43:48Z","timestamp":1672206228000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3551793.3551839"}},"subtitle":["a write-optimized persistent log-structured hash-table"],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":53,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10.14778\/3551793.3551839"],"URL":"https:\/\/doi.org\/10.14778\/3551793.3551839","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2022,7]]}}}