A disaggregated RDMA-based HNSW design using a small cached routing index and batched cluster fetches, with evaluation only against self-defined baselines.
Fast approximate nearest neighbor search with the navigating spreading-out graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DB 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Efficient Vector Search on Disaggregated Memory with d-HNSW
A disaggregated RDMA-based HNSW design using a small cached routing index and batched cluster fetches, with evaluation only against self-defined baselines.