DART: A Lock-free Two-layer Hashed ART Index for Disaggregated Memory
Proceedings of the ACM on Management of Data · 02.04.2026 · 4 (1) · 1-25
DOI: 10.1145/3786636 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the ACM on Management of Data, online erschienen am 07.04.2026. Verfasst von Bowen Zhang und 8 weiteren Autor:innen. Die Arbeit nennt 59 Literaturangaben. Gefördert von: National Key Research and Development Program of China, National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities.
Abstract (Originalsprache)
Disaggregated memory architecture decouples computing and memory resources into separate pools connected via high-speed interconnect technologies, offering substantial advantages in scalability and resource utilization. However, this architecture also poses unique challenges in designing effective index structures and concurrency protocols due to increased remote memory access overhead and its shared-everything nature. In this paper, we present DART, a lock-free two-layer hashed Adaptive Radix Tree (ART) designed to minimize remote memory access while ensuring high concurrency and crash consistency in the disaggregated memory architecture. DART incorporates a hash-based Express Skip Table at its upper layer, which reduces the round trips of remote memory access during index traversal. In the base layer, DART employs an Adaptive Hashed Layout within ART nodes, confining remote memory accesses during in-node searches to small hash buckets. By further leveraging Decoupled Metadata Organization, DART achieves lock-free atomic updates, enabling high scalability and ensuring crash consistency. Our evaluation demonstrates that DART outperforms state-of-the-art counterparts by up to 5.8× in YCSB workloads.
Förderung
- National Key Research and Development Program of China
- National Natural Science Foundation of China
- Fundamental Research Funds for the Central Universities
- National Science Foundation
Zitieren
APA
Zhang, B., Zheng, S., Shu, S., Li, J., Qi, Z., Huang, W., Wang, J., Huang, L., & Mei, H. (2026). DART: A Lock-free Two-layer Hashed ART Index for Disaggregated Memory. Proceedings of the ACM on Management of Data, 4(1), 1-25. https://doi.org/10.1145/3786636
Vancouver
Zhang B, Zheng S, Shu S, Li J, Qi Z, Huang W, et al. DART: A Lock-free Two-layer Hashed ART Index for Disaggregated Memory. Proceedings of the ACM on Management of Data. 2026;4(1):1-25. doi:10.1145/3786636
BibTeX
@article{Zhang2026,
author = {Zhang, Bowen and Zheng, Shengan and Shu, Shi and Li, Jingxiang and Qi, Zhenlin and Huang, Weiquan and Wang, Jianguo and Huang, Linpeng and Mei, Hong},
title = {DART: A Lock-free Two-layer Hashed ART Index for Disaggregated Memory},
journal = {Proceedings of the ACM on Management of Data},
year = {2026},
volume = {4},
number = {1},
pages = {1--25},
doi = {10.1145/3786636}
}
EUVIMED