



An efficient vector search system designed for disaggregated memory architectures. d-HNSW optimizes HNSW for environments where compute and memory are separated, typical in modern cloud and distributed systems.
Published in May 2025 (arXiv:2505.11783), d-HNSW addresses efficient vector search in disaggregated memory architectures where compute nodes access memory over network.
Modern cloud systems increasingly separate:
This enables flexible resource allocation but challenges traditional algorithms.
Network-Aware Traversal: Optimizes HNSW graph traversal for network latency
Prefetching: Anticipates needed nodes and fetches in batches
Caching: Intelligent caching of frequently accessed graph regions
Batching: Groups operations to amortize network overhead
ArXiv preprint arXiv:2505.11783 (2025)
Loading more......