d-HNSW: A High-performance Vector Search Engine on Disaggregated Memory
Proceedings of the ACM on Measurement and Analysis of Computing Systems · 29.05.2026 · 10 (2) · 1-28
DOI: 10.1145/3805634 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the ACM on Measurement and Analysis of Computing Systems, online erschienen am 29.05.2026. Verfasst von Fei Fang und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 76 Literaturangaben. Gefördert von: NSF.
Abstract (Originalsprache)
Efficient vector search is essential for powering large-scale AI applications, such as LLMs. Existing solutions are designed for monolithic architectures where compute and memory are tightly coupled. Recently, disaggregated architecture breaks this coupling by separating computation and memory resources into independently scalable pools to improve utilization. However, applying vector database to a disaggregated memory system brings unique challenges to system design due to its graph-based index. We present d-HNSW, the first RDMA-based vector search engine optimized for disaggregated memory systems. d-HNSW preserves HNSW's high accuracy while addressing the new system-level challenges introduced by disaggregation: 1) network inefficiency from pointer-chasing traversals, 2) non-contiguous remote memory layout induced by dynamic insertions, 3) redundant data transfers in batch workloads, and 4) resource underutilization due to sequential execution. d-HNSW tackles these challenges through a set of hardware-algorithm co-designed techniques, including 1) balanced clustering with a lightweight representative index to reduce network round-trips and ensure predictable latency, 2) an RDMA-friendly graph layout that preserves data contiguity under dynamic insertions, 3) query-aware data loading to eliminate redundant fetches across batch queries, and 4) a pipelined execution model that overlaps RDMA transfers with computation to hide network latency and improve throughput. Our evaluation results in a public cloud show that d-HNSW achieves up to < 10 -2 × query latency and >100× query throughput compared to other baselines, while maintaining a high recall of 94%.
Förderung
- NSF
Zitieren
APA
Fang, F., Liu, Y., & Qian, C. (2026). d-HNSW: A High-performance Vector Search Engine on Disaggregated Memory. Proceedings of the ACM on Measurement and Analysis of Computing Systems, 10(2), 1-28. https://doi.org/10.1145/3805634
Vancouver
Fang F, Liu Y, Qian C. d-HNSW: A High-performance Vector Search Engine on Disaggregated Memory. Proceedings of the ACM on Measurement and Analysis of Computing Systems. 2026;10(2):1-28. doi:10.1145/3805634
BibTeX
@article{Fang2026,
author = {Fang, Fei and Liu, Yi and Qian, Chen},
title = {d-HNSW: A High-performance Vector Search Engine on Disaggregated Memory},
journal = {Proceedings of the ACM on Measurement and Analysis of Computing Systems},
year = {2026},
volume = {10},
number = {2},
pages = {1--28},
doi = {10.1145/3805634}
}
EUVIMED