{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,13]],"date-time":"2026-09-13T12:54:32Z","timestamp":1789304072150,"version":"build-2803163510"},"reference-count":49,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T00:00:00Z","timestamp":1707955200000},"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":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2024,6,30]]},"abstract":"<jats:p>\n            Persistent memory (PM) presents a unique opportunity for designing data management systems that offer improved performance, scalability, and instant restart capability. As a widely used data structure for managing data in such systems, B\n            <jats:sup>+<\/jats:sup>\n            -Tree must address the challenges presented by PM in both data consistency and device performance. However, existing studies suffer from significant performance degradation when maintaining data consistency on PM. To settle this problem, we propose a new concurrent B\n            <jats:sup>+<\/jats:sup>\n            -Tree, CC-Tree, optimized for PM. CC-Tree ensures data consistency while providing high concurrent performance, thanks to several technologies, including partitioned metadata, log-free split, and lock-free read. We conducted experiments using state-of-the-art indices, and the results demonstrate significant performance improvements, including approximately 1.2\u20131.6x search, 1.5\u20131.7x insertion, 1.5\u20132.8x update, 1.9\u20134x deletion, 0.9\u201310x range scan, and up to 1.55\u20131.82x in hybrid workloads.\n          <\/jats:p>","DOI":"10.1145\/3638717","type":"journal-article","created":{"date-parts":[[2023,12,25]],"date-time":"2023-12-25T11:38:01Z","timestamp":1703504281000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A Concise Concurrent B\n            <sup>+<\/sup>\n            -Tree for Persistent Memory"],"prefix":"10.1145","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-5090-6141","authenticated-orcid":false,"given":"Yan","family":"Wei","sequence":"first","affiliation":[{"name":"Xi\u2019an Jiaotong University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1434-7016","authenticated-orcid":false,"given":"Zhang","family":"Xingjun","sequence":"additional","affiliation":[{"name":"Xi\u2019an Jiaotong University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,2,15]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/2463585.2463589"},{"issue":"5","key":"e_1_3_2_3_2","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1145\/3187009.3164147","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 Levandoski, Umar Farooq Minhas, and Per-Ake Larson. 2018. Bztree: A high-performance latch-free range index for non-volatile memory. Proceedings of the VLDB Endowment 11, 5 (2018), 553\u2013565.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_3_2_4_2","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1109\/IEDM.2004.1419228","volume-title":"Proceedings of the IEDM Technical Digest. IEEE International Electron Devices Meeting, 2004.","author":"Baek I. G.","year":"2004","unstructured":"I. G. Baek, M. S. Lee, S. Seo, M. J. Lee, D. H. Seo, D.-S. Suh, J. C. Park, S. O. Park, H. S. Kim, I. K. Yoo, U-In Chung, and J.T. Moon . 2004. Highly scalable nonvolatile resistive memory using simple binary oxide driven by asymmetric unipolar voltage pulses. In Proceedings of the IEDM Technical Digest. IEEE International Electron Devices Meeting, 2004. IEEE, 587\u2013590."},{"key":"e_1_3_2_5_2","unstructured":"Brian Beeler. 2019. Intel optane DC persistent memory module (PMM). Retrieved January 17 2024 from https:\/\/www.storagereview.com\/news\/intel-optane-dc-persistent-memory-module-pmm"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3022671.2984019"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.5555\/3386691.3386712"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752947"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407850"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378515"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.5555\/3489146.3489201"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/1961295.1950380"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_3_2_14_2","volume-title":"Dell EMC NVDIMM-N Persistent Memory User Guide","author":"Corporation Dell","year":"2023","unstructured":"Dell Corporation. 2023. Dell EMC NVDIMM-N Persistent Memory User Guide. Retrieved from https:\/\/bit.ly\/3rgIiPm"},{"key":"e_1_3_2_15_2","volume-title":"How to Emulate Persistent Memory Using Dynamic Random-access Memory (DRAM)","author":"Corporation Intel","year":"2017","unstructured":"Intel Corporation. 2017. How to Emulate Persistent Memory Using Dynamic Random-access Memory (DRAM). Retrieved from https:\/\/intel.ly\/3Fqi9Bm"},{"key":"e_1_3_2_16_2","volume-title":"5-Level Paging and 5-Level EPT White Paper","author":"Corporation Intel","year":"2018","unstructured":"Intel Corporation. 2018. 5-Level Paging and 5-Level EPT White Paper. Retrieved from https:\/\/intel.ly\/3FqFa79"},{"key":"e_1_3_2_17_2","volume-title":"PMWatch (PersistentMemoryWatch)","author":"Corporation Intel","year":"2020","unstructured":"Intel Corporation. 2020. PMWatch (PersistentMemoryWatch). Retrieved from https:\/\/github.com\/intel\/intel-pmwatch"},{"key":"e_1_3_2_18_2","volume-title":"Intel\u00ae Architecture Instruction Set Extensions and Future Features","author":"Corporation Intel","year":"2023","unstructured":"Intel Corporation. 2023. Intel\u00ae Architecture Instruction Set Extensions and Future Features. Retrieved from https:\/\/github.com\/intel\/intel-pmwatch"},{"key":"e_1_3_2_19_2","volume-title":"Samsung Electronics Introduces Industry\u2019s First 512GB CXL Memory Module","author":"Corporation Samsung","year":"2022","unstructured":"Samsung Corporation. 2022. Samsung Electronics Introduces Industry\u2019s First 512GB CXL Memory Module. Retrieved from https:\/\/bit.ly\/3P66knr"},{"key":"e_1_3_2_20_2","volume-title":"Samsung Electronics Unveils Far-Reaching, Next-Generation Memory Solutions at Flash Memory Summit 2022","author":"Corporation Samsung","year":"2022","unstructured":"Samsung Corporation. 2022. Samsung Electronics Unveils Far-Reaching, Next-Generation Memory Solutions at Flash Memory Summit 2022. Retrieved from https:\/\/bit.ly\/3SbMDvU"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3503222.3507743"},{"issue":"11","key":"e_1_3_2_22_2","article-title":"Intel\u00ae 64 and ia-32 architectures software developer\u2019s manual","volume":"2","author":"Guide Part","year":"2011","unstructured":"Part Guide. 2011. Intel\u00ae 64 and ia-32 architectures software developer\u2019s manual. Volume 3B: System Programming Guide, Part 2, 11 (2011).","journal-title":"Volume 3B: System Programming Guide, Part"},{"key":"e_1_3_2_23_2","first-page":"187","volume-title":"Proceedings of the 16th USENIX Conference on File and Storage Technologies (FAST 18)","author":"Hwang Deukyeon","year":"2018","unstructured":"Deukyeon Hwang, Wook-Hee Kim, Youjip Won, and Beomseok Nam. 2018. Endurable transient inconsistency in \\(\\lbrace\\) Byte-Addressable \\(\\rbrace\\) Persistent \\(\\lbrace\\) B+-Tree \\(\\rbrace\\) . In Proceedings of the 16th USENIX Conference on File and Storage Technologies (FAST 18). 187\u2013200."},{"key":"e_1_3_2_24_2","unstructured":"Joseph Izraelevitz Jian Yang Lu Zhang Juno Kim Xiao Liu Amirsaman Memaripour Yun Joon Soh Zixuan Wang Yi Xu Subramanya R. Dulloor et\u00a0al. 2019. Basic performance measurements of the intel optane DC persistent memory module. arXiv:1903.05714v3. Retrieved from https:\/\/arxiv.org\/abs\/1903.05714v3"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3538643.3539745"},{"key":"e_1_3_2_26_2","first-page":"424","volume-title":"Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles","author":"Kim Wook-Hee","year":"2021","unstructured":"Wook-Hee Kim, R Madhava Krishnan, Xinwei Fu, Sanidhya Kashyap, and Changwoo Min. 2021. PACTree: A high performance persistent range index using PAC guidelines. In Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles. 424\u2013439."},{"key":"e_1_3_2_27_2","first-page":"257","volume-title":"Proceedings of the 15th USENIX Conference on File and Storage Technologies (FAST 17)","author":"Lee Se Kwon","year":"2017","unstructured":"Se Kwon Lee, K Hyun Lim, Hyunsub Song, Beomseok Nam, and Sam H. Noh. 2017. \\(\\lbrace\\) WORT \\(\\rbrace\\) : Write optimal radix tree for persistent memory storage systems. In Proceedings of the 15th USENIX Conference on File and Storage Technologies (FAST 17). 257\u2013270."},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359635"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/319628.319663"},{"key":"e_1_3_2_30_2","first-page":"38","volume-title":"Proceedings of the 2013 IEEE 29th International Conference on Data Engineering","author":"Leis Viktor","year":"2013","unstructured":"Viktor Leis, Alfons Kemper, and Thomas Neumann. 2013. The adaptive radix tree: ARTful indexing for main-memory databases. In Proceedings of the 2013 IEEE 29th International Conference on Data Engineering. IEEE, 38\u201349."},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/2933349.2933352"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372728"},{"key":"e_1_3_2_33_2","first-page":"302","volume-title":"Proceedings of the 2013 IEEE 29th International Conference on Data Engineering","author":"Levandoski Justin J.","year":"2013","unstructured":"Justin J. Levandoski, David B. Lomet, and Sudipta Sengupta. 2013. The Bw-Tree: A B-tree for new hardware platforms. In Proceedings of the 2013 IEEE 29th International Conference on Data Engineering. IEEE, 302\u2013313."},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384355"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","unstructured":"Baotong Lu Xiangpeng Hao Tianzheng Wang and Eric Lo. 2020. Dash: scalable hashing on persistent memory. Proc. VLDB Endow. 13 8 (2020) 1147\u20131161. 10.14778\/3389133.3389134","DOI":"10.14778\/3389133.3389134"},{"key":"e_1_3_2_36_2","first-page":"1","volume-title":"Proceedings of the 19th USENIX Conference on File and Storage Technologies","author":"Ma Shaonan","year":"2021","unstructured":"Shaonan Ma, Kang Chen, Shimin Chen, Mengxing Liu, Jianglang Zhu, Hongbo Kang, and Yongwei Wu. 2021. \\(\\lbrace\\) ROART \\(\\rbrace\\) : Range-query optimized persistent \\(\\lbrace\\) ART \\(\\rbrace\\) . In Proceedings of the 19th USENIX Conference on File and Storage Technologies. 1\u201316."},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.5555\/3323298.3323302"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915251"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.524.0465"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4842-4932-1"},{"key":"e_1_3_2_41_2","unstructured":"Schwalb David Berning Tim Faust Martin Dreseler Markus and Plattner Hasso. 2015. nvm malloc: Memory allocation for NVRAM. In Proceedings of the ADMS@VLDB. 61\u201372."},{"key":"e_1_3_2_42_2","first-page":"xii\u2013xii","volume-title":"Proceedings of the 2021 IEEE Symposium on High-Performance Interconnects","author":"Sharma Debendra Das","year":"2021","unstructured":"Debendra Das Sharma. 2021. Keynote 1: Compute express link (CXL) changing the game for cloud computing. In Proceedings of the 2021 IEEE Symposium on High-Performance Interconnects. IEEE, xii\u2013xii."},{"key":"e_1_3_2_43_2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/HOTI55740.2022.00017","volume-title":"Proceedings of the 2022 IEEE Symposium on High-Performance Interconnects","author":"Sharma Debendra Das","year":"2022","unstructured":"Debendra Das Sharma. 2022. Compute express link\u00ae: An open industry-standard interconnect enabling heterogeneous data-centric computing. In Proceedings of the 2022 IEEE Symposium on High-Performance Interconnects. IEEE, 5\u201312."},{"key":"e_1_3_2_44_2","first-page":"1","volume-title":"Proceedings of the 2015 IEEE International Memory Workshop","author":"Suzuki Kosuke","year":"2015","unstructured":"Kosuke Suzuki and Steven Swanson. 2015. A survey of trends in non-volatile memory technologies: 2000-2014. In Proceedings of the 2015 IEEE International Memory Workshop. IEEE, 1\u20134."},{"key":"e_1_3_2_45_2","first-page":"1","volume-title":"Proceedings of the 15th International Workshop on Data Management on New Hardware","author":"Renen Alexander Van","year":"2019","unstructured":"Alexander Van Renen, Lukas Vogel, Viktor Leis, Thomas Neumann, and Alfons Kemper. 2019. Persistent memory I\/O primitives. In Proceedings of the 15th International Workshop on Data Management on New Hardware. 1\u20137."},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.5555\/1960475.1960480"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/1961295.1950379"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-015-1509-2"},{"key":"e_1_3_2_49_2","unstructured":"Jun Yang Qingsong Wei Cheng Chen Chundong Wang Khai Leong Yong and Bingsheng He. 2015. NV-Tree: reducing consistency cost for NVM-based single level systems. In Proceedings of the 13th USENIX Conference on File and Storage Technologies (FAST\u201915). USENIX Association USA 167\u2013181."},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372717"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638717","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638717","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:33Z","timestamp":1750291413000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638717"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,15]]},"references-count":49,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6,30]]}},"alternative-id":["10.1145\/3638717"],"URL":"https:\/\/doi.org\/10.1145\/3638717","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,15]]},"assertion":[{"value":"2023-08-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-12-19","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}