{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T05:30:33Z","timestamp":1769146233147,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819557158","type":"print"},{"value":"9789819557165","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-5716-5_25","type":"book-chapter","created":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T13:07:06Z","timestamp":1769087226000},"page":"403-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["WROTree: Write and\u00a0Range Query Optimal Tree in\u00a0Persistent Memory"],"prefix":"10.1007","author":[{"given":"Zhongbo","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lina","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinbao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaozong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,23]]},"reference":[{"issue":"5","key":"25_CR1","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1145\/3187009.3164147","volume":"11","author":"J Arulraj","year":"2018","unstructured":"Arulraj, J., Levandoski, J., Minhas, U.F., Larson, P.A.: Bztree: a high-performance latch-free range index for non-volatile memory. Proc. VLDB Endow. 11(5), 553\u2013565 (2018)","journal-title":"Proc. VLDB Endow."},{"issue":"12","key":"25_CR2","doi-asserted-by":"publisher","first-page":"2634","DOI":"10.14778\/3407790.3407850","volume":"13","author":"Y Chen","year":"2020","unstructured":"Chen, Y., Lu, Y., Fang, K., Wang, Q., Shu, J.: utree: a persistent b+-tree with low tail latency. Proc. VLDB Endow. 13(12), 2634\u20132648 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Fridman, Y., et al.: Assessing the use cases of persistent memory in high-performance scientific computing. In: 2021 IEEE\/ACM 11th Workshop on Fault Tolerance for HPC at Extreme Scale (FTXS), pp. 11\u201320 (2021)","DOI":"10.1109\/FTXS54580.2021.00006"},{"issue":"11","key":"25_CR4","doi-asserted-by":"publisher","first-page":"2477","DOI":"10.14778\/3551793.3551808","volume":"15","author":"Y He","year":"2022","unstructured":"He, Y., Lu, D., Huang, K., Wang, T.: Evaluating persistent memory range indexes: part two. Proc. VLDB Endow. 15(11), 2477\u2013490 (2022)","journal-title":"Proc. VLDB Endow."},{"key":"25_CR5","unstructured":"Intel. eadr: new opportunities for persistent memory applications (2021). https:\/\/www.intel.com\/content\/www\/us\/en\/developer\/articles\/technical\/eadr-new-opportunities-for-persistent-memory-applications.html"},{"key":"25_CR6","unstructured":"Intel. Pmdk. https:\/\/github.com\/pmem\/pmdk"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Kim, W. H., Krishnan, R.M., Fu, X., Kashyap, S., Min, C.: Pactree: a high performance persistent range index using pac guidelines. In: Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles, SOSP \u201921, pp. 424\u2013439. Association for Computing Machinery, New York 2021","DOI":"10.1145\/3477132.3483589"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Lee, S. K., Mohan, J., Kashyap, S., Kim, T., Chidambaram, V.: Recipe: converting concurrent dram indexes to persistent-memory indexes. In: Proceedings of the 27th ACM Symposium on Operating Systems Principles, SOSP \u201919, pp. 462\u2013477. Association for Computing Machinery, New York (2019)","DOI":"10.1145\/3341301.3359635"},{"key":"25_CR9","unstructured":"Lee, S.K., Lim, K.H., Song, H., Nam, B., Noh, S.H.: Wort: write optimal radix tree for persistent memory storage systems. In: Proceedings of the 15th Usenix Conference on File and Storage Technologies, FAST\u201917, pp. 257\u2013270. USENIX Association., USA (2017)"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Leis, V., Scheibner, F., Kemper, A., Neumann, T.: The art of practical synchronization. In: Proceedings of the 12th International Workshop on Data Management on New Hardware, DaMoN \u201916, New York. Association for Computing Machinery (2016)","DOI":"10.1145\/2933349.2933352"},{"issue":"4","key":"25_CR11","doi-asserted-by":"publisher","first-page":"574","DOI":"10.14778\/3372716.3372728","volume":"13","author":"L Lersch","year":"2019","unstructured":"Lersch, L., Hao, X., Oukid, I., Wang, T., Willhalm, T.: Evaluating persistent memory range indexes. Proc. VLDB Endow. 13(4), 574\u2013587 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Liu, M., Xing, J., Chen, K., Wu, Y.: Building scalable NVM-based b+tree with HTM. In: Proceedings of the 48th International Conference on Parallel Processing, ICPP \u201919. Association for Computing Machinery, New York (2019)","DOI":"10.1145\/3337821.3337827"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Luo, Y., Jin, P., Zhang, Q., Cheng, B.: Tlbtree: a read\/write-optimized tree index for non-volatile memory. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 1889\u20131894 (2021)","DOI":"10.1109\/ICDE51399.2021.00172"},{"key":"25_CR14","unstructured":"Ma, S., et al.: ROART: range-query optimized persistent ART. In: 19th USENIX Conference on File and Storage Technologies (FAST 21), pp. 1\u201316. USENIX Association (2021)"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Mishra, S., Gohil, B.N., Ray, S.: A survey on persistent memory indexes: Recent advances, challenges and opportunities. J. Syst. Archit., 151(C) (2024)","DOI":"10.1016\/j.sysarc.2024.103140"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"11781","DOI":"10.1109\/ACCESS.2023.3241146","volume":"11","author":"A Shafiee","year":"2023","unstructured":"Shafiee, A., Pasricha, S., Nikdast, M.: A survey on optical phase-change memory: the promise and challenges. IEEE Access 11, 11781\u201311803 (2023)","journal-title":"IEEE Access"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Wang, K., Yang, G., Li, Y., Zhang, H., Gao, M.: When tree meets hash: Reducing random reads for index structures on persistent memories. Proc. ACM Manag. Data, 1(1) (2023)","DOI":"10.1145\/3588959"},{"issue":"6","key":"25_CR18","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.14778\/3514061.3514066","volume":"15","author":"B Zhang","year":"2022","unstructured":"Zhang, B., Zheng, S., Qi, Z., Huang, L.: Nbtree: a lock-free pm-friendly persistent b+-tree for eadr-enabled pm systems. Proc. VLDB Endow. 15(6), 1187\u20131200 (2022)","journal-title":"Proc. VLDB Endow."},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, R., et al.: Pftree: optimizing persistent adaptive radix tree for pm systems on eadr platform. In: Database Systems for Advanced Applications: 28th International Conference, DASFAA 2023, Tianjin, China, April 17\u201320, 2023, Proceedings, Part I, pp. 46\u201361. Springer (2023)","DOI":"10.1007\/978-3-031-30637-2_4"},{"issue":"4","key":"25_CR20","doi-asserted-by":"publisher","first-page":"421","DOI":"10.14778\/3372716.3372717","volume":"13","author":"X Zhou","year":"2019","unstructured":"Zhou, X., Shou, L., Chen, K., Hu, W., Chen, G.: Dptree: differential indexing for persistent memory. Proc. VLDB Endow. 13(4), 421\u2013434 (2019)","journal-title":"Proc. VLDB Endow."}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5716-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T13:07:12Z","timestamp":1769087232000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5716-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819557158","9789819557165"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5716-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"23 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb2025.sau.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}