{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:19:08Z","timestamp":1778271548658,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819203628","type":"print"},{"value":"9789819203635","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-92-0363-5_38","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T19:53:20Z","timestamp":1778270000000},"page":"623-638","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Workload-Aware DHB+Tree: A Dynamic B+-Tree for\u00a0Persistent Memory"],"prefix":"10.1007","author":[{"given":"Jiarui","family":"Qi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junbao","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derong","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiezheng","family":"Nie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yue","family":"Kou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"38_CR1","unstructured":"Yang, J., Kim, J., Hoseinzadeh, M., Izraelevitz, J., Swanson, S.: An empirical guide to the behavior and use of scalable persistent memory. In: 18th USENIX Conference on File and Storage Technologies (FAST 2020), pp. 169\u2013182. USENIX Association (2020)"},{"key":"38_CR2","unstructured":"Yang, J., Wei, Q., Chen, C., Wang, C., Yong, K.L., He, B.: NV-Tree: reducing consistency cost for NVM-based single level systems. In: 13th USENIX Conference on File and Storage Technologies (FAST 2015), pp. 167\u2013181. USENIX Association (2015)"},{"key":"38_CR3","doi-asserted-by":"publisher","unstructured":"Chen, S., Jin, Q.: Persistent B+-trees in non-volatile main memory. Proc. VLDB Endow. 8(7), 786\u2013797 (2015). https:\/\/doi.org\/10.14778\/2752939.2752947","DOI":"10.14778\/2752939.2752947"},{"issue":"5","key":"38_CR4","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1145\/3164135.3164147","volume":"11","author":"J Arulraj","year":"2018","unstructured":"Arulraj, J., Levandoski, J., Minhas, U.F., Larson, P.: BZTREE: a high-performance latch-free range index for non-volatile memory. Proc. VLDB Endow. 11(5), 553\u2013565 (2018). https:\/\/doi.org\/10.1145\/3164135.3164147","journal-title":"Proc. VLDB Endow."},{"key":"38_CR5","doi-asserted-by":"publisher","unstructured":"Wang, T., Levandoski, J., Larson, P.: Easy lock-free indexing in non-volatile memory. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 461\u2013472. IEEE (2018). https:\/\/doi.org\/10.1109\/ICDE.2018.00049","DOI":"10.1109\/ICDE.2018.00049"},{"key":"38_CR6","unstructured":"Hwang, D., Kim, W., Won, Y., Nam, B.: Endurable transient inconsistency in byte-addressable persistent B+-tree. In: 16th USENIX Conference on File and Storage Technologies (FAST 2018), pp. 187\u2013200. USENIX Association (2018)"},{"key":"38_CR7","doi-asserted-by":"publisher","unstructured":"Li, T., Wang, H., Shao, A., Wang, D.: SSB-Tree: making persistent memory B+-trees crash-consistent and concurrent by Lazy-Box. In: 2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 70\u201380. IEEE (2022). https:\/\/doi.org\/10.1109\/IPDPS53621.2022.00016","DOI":"10.1109\/IPDPS53621.2022.00016"},{"key":"38_CR8","doi-asserted-by":"publisher","unstructured":"Oukid, I., Lasperas, J., Nica, A., Willhalm, T., Lehner, W.: FPTree: a hybrid SCM-DRAM persistent and concurrent B-tree for storage class memory. In: Proceedings of the 2016 International Conference on Management of Data (SIGMOD 2016), pp. 371\u2013386. ACM (2016). https:\/\/doi.org\/10.1145\/2882903.2915251","DOI":"10.1145\/2882903.2915251"},{"key":"38_CR9","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.14778\/3407790.3407850","DOI":"10.14778\/3407790.3407850"},{"key":"38_CR10","doi-asserted-by":"publisher","unstructured":"Liu, J., Chen, S., Wang, L.: LB+Trees: optimizing persistent index performance on 3DXPoint memory. Proc. VLDB Endow. 13(7), 1078\u20131090 (2020). https:\/\/doi.org\/10.14778\/3384345.3384355","DOI":"10.14778\/3384345.3384355"},{"key":"38_CR11","doi-asserted-by":"publisher","unstructured":"Li, Z., et al.: CCL-BTree: a crash-consistent locality-aware B+-tree for reducing XPBuffer-induced write amplification in persistent memory. In: Proceedings of the Nineteenth European Conference on Computer Systems (EuroSys 2024), pp. 441\u2013455. ACM (2024). https:\/\/doi.org\/10.1145\/3627703.3629582","DOI":"10.1145\/3627703.3629582"},{"issue":"4","key":"38_CR12","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":"38_CR13","doi-asserted-by":"publisher","unstructured":"Zhang, Z., et al.: PLIN: a persistent learned index for non-volatile memory with high performance and instant recovery. Proc. VLDB Endow. 16(2), 243\u2013255 (2022). https:\/\/doi.org\/10.14778\/3565816.3565826","DOI":"10.14778\/3565816.3565826"},{"key":"38_CR14","doi-asserted-by":"publisher","unstructured":"Zhang, Z., et al.: PLIN: a persistent learned index for non-volatile memory with high performance and instant recovery. Proc. VLDB Endow. 16(2), 243\u2013255 (2022). https:\/\/doi.org\/10.14778\/3565816.3565826","DOI":"10.14778\/3565816.3565826"},{"key":"38_CR15","doi-asserted-by":"publisher","unstructured":"Kraska, T., Beutel, A., Chi, E.H., Dean, J., Polyzotis, N.: The case for learned index structures. In: Proceedings of the 2018 International Conference on Management of Data (SIGMOD 2018), pp. 489\u2013504. ACM (2018). https:\/\/doi.org\/10.1145\/3183713.3196909","DOI":"10.1145\/3183713.3196909"},{"key":"38_CR16","doi-asserted-by":"publisher","unstructured":"Ding, J., et al.: ALEX: an updatable adaptive learned index. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data (SIGMOD 2020), pp. 969\u2013984. ACM (2020). https:\/\/doi.org\/10.1145\/3318464.3389711","DOI":"10.1145\/3318464.3389711"},{"key":"38_CR17","doi-asserted-by":"publisher","unstructured":"Wu, J., Zhang, Y., Chen, S., Wang, J., Chen, Y., Xing, C.: Updatable learned index with precise positions. Proc. VLDB Endow. 14(8), 1276\u20131288 (2021). https:\/\/doi.org\/10.14778\/3457390.3457393","DOI":"10.14778\/3457390.3457393"},{"issue":"4","key":"38_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3677138","volume":"2","author":"W Yu","year":"2024","unstructured":"Yu, W., Luo, S., Yu, Z., Cong, G.: CAMAL: optimizing LSM-trees via active learning. Proc. ACM Manage. Data 2(4), 1\u201326 (2024). https:\/\/doi.org\/10.1145\/3677138","journal-title":"Proc. ACM Manage. Data"},{"key":"38_CR19","doi-asserted-by":"publisher","unstructured":"Dayan, N., Athanassoulis, M., Idreos, S.: Monkey: optimal navigable key-value store. In: Proceedings of the 2017 ACM International Conference on Management of Data (SIGMOD 2017), pp. 79\u201394. ACM (2017). https:\/\/doi.org\/10.1145\/3035918.3064054","DOI":"10.1145\/3035918.3064054"},{"issue":"2","key":"38_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3638717","volume":"21","author":"Y Wei","year":"2024","unstructured":"Wei, Y., Zhang, X.: A concise concurrent B+-tree for persistent memory. ACM Trans. Archit. Code Optim. 21(2), 1\u201325 (2024). https:\/\/doi.org\/10.1145\/3638717","journal-title":"ACM Trans. Archit. Code Optim."},{"key":"38_CR21","doi-asserted-by":"publisher","unstructured":"Kim, W.-H., Krishnan, R.M., Fu, X., Kashyap, S., Min, C.: A high performance persistent range index using PAC guidelines. In: Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles (SOSP 2021), pp. 424\u2013439. Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3477132.3483589","DOI":"10.1145\/3477132.3483589"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-0363-5_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T19:53:21Z","timestamp":1778270001000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-0363-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819203628","9789819203635"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-0363-5_38","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":"9 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2026.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}