Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph
Summary: Introduces MRNG, a low-degree monotonic graph with near-logarithmic ANNS search. Its practical approximation, NSG, jointly preserves connectivity, short paths, and compact indexing, enabling billion-scale deployment and outperforming prior graph methods. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Cong Fu (Zhejiang University)
- 2. Chao Xiang (Zhejiang University)
- 3. Changxu Wang (Alibaba; Fabu Inc.; Zhejiang University)
- 4. Deng Cai (Alibaba; Fabu Inc.; Zhejiang University)
BibTeX Citation
@article{fu_vldb19,
title = {{Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph}},
author = {Fu, Cong and Xiang, Chao and Wang, Changxu and Cai, Deng},
journal = {PVLDB},
series = {{VLDB} '19},
volume = {12},
number = {5},
pages = {461--474},
doi = {10.14778/3303753.3303754},
url = {https://doi.org/10.14778/3303753.3303754},
year = {2019}
}
Incoming Citations (Sorted by Pagerank)
Showing 24 of 124 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next