The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Fast approximate nearest neighbor search with the navigating spreading-out graph
Open accessAbstract
Approximate nearest neighbor search (ANNS) is a fundamental problem in databases and data mining. A scalable ANNS algorithm should be both memory-efficient and fast. Some early graph-based approaches have shown attractive theoretical guarantees on search time complexity, but they all suffer from the problem of high indexing time complexity. Recently, some graph-based methods have been proposed to reduce indexing complexity by approximating the traditional graphs; these methods have achieved revolutionary performance on million-scale datasets. Yet, they still can not scale to billion-node databases. In this paper, to further improve the search-efficiency and scalability of graph-based methods, we start by introducing four aspects: (1) ensuring the connectivity of the graph; (2) lowering the average out-degree of the graph for fast traversal; (3) shortening the search path; and (4) reducing the index size. Then, we propose a novel graph structure called Monotonic Relative Neighborhood Graph (MRNG) which guarantees very low search complexity (close to logarithmic time). To further lower the indexing complexity and make it practical for billion-node ANNS problems, we propose a novel graph structure named Navigating Spreading-out Graph (NSG) by approximating the MRNG. The NSG takes the four aspects into account simultaneously. Extensive experiments show that NSG outperforms all the existing algorithms significantly. In addition, NSG shows superior performance in the E-commercial scenario of Taobao (Alibaba Group) and has been integrated into their billion-scale search engine.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Proceedings of IEEE Conference on Computer Vision and Pattern Recognition
(1993) · doi:10.1109/cvpr.1993 · Cited by 17,667
Introduction to Information Retrieval
Manning, C. D., Raghavan, P., & Schütze, H. (2008) · doi:10.1017/cbo9780511809071 · Cited by 11,288
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
Voronoi diagrams—a survey of a fundamental geometric data structure
Aurenhammer, F. (1991) · ACM Computing Surveys · doi:10.1145/116873.116880 · Cited by 4,340
Billion-scale similarity search with GPUs
Johnson, J., Douze, M., & Jegou, H. (2021) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2019.2921572 · Cited by 4,228
The R*-tree: an efficient and robust access method for points and rectangles
Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B. (1990) · Proceedings of the 1990 ACM SIGMOD international conference on Management of data · doi:10.1145/93597.98741 · Cited by 4,161
Billion-scale similarity search with GPUs
Johnson, J., Douze, M., & Jégou, H. (2017) · arXiv · doi:10.48550/arxiv.1702.08734 · Cited by 4,140
(1999) · Cited by 3,186
Product Quantization for Nearest Neighbor Search
Jégou, H., Douze, M., & Schmid, C. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.57 · Cited by 2,956
Weiss, Y., Torralba, A. B., & Fergus, R. (2008) · neural information processing systems · Cited by 2,767
Proceedings of the International Joint Conference on Artificial Intelligence 2007
Bundy, A. (2007) · International Joint Conference on Artificial Intelligence · Cited by 2,761
Kleinberg, J. M. (2000) · Nature · doi:10.1038/35022643 · Cited by 1,737
The R*-tree: an efficient and robust access method for points and rectangles
Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B. (1990) · ACM SIGMOD Record · doi:10.1145/93605.98741 · Cited by 1,424
Robust and fast similarity search for moving object trajectories
Chen, L., Özsu, M. T., & Oria, V. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066213 · Cited by 1,336
The relative neighbourhood graph of a finite planar set
Toussaint, G. T. (1980) · Pattern Recognition · doi:10.1016/0031-3203(80)90066-7 · Cited by 1,008
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
Har-Peled, S., Indyk, P., & Motwani, R. (2012) · Theory of Computing · doi:10.4086/toc.2012.v008a014 · Cited by 816
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
Fukunaga, K., & Narendra, P. M. (1975) · IEEE Transactions on Computers · doi:10.1109/t-c.1975.224297 · Cited by 736
Optimised KD-trees for fast image descriptor matching
Silpa-Anan, C., & Hartley, R. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587638 · Cited by 677
Efficient k-nearest neighbor graph construction for generic similarity measures
Dong, W., Moses, C., & Li, K. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963487 · Cited by 673
Relative neighborhood graphs and their relatives
Jaromczyk, J. W., & Toussaint, G. T. (1992) · Proceedings of the IEEE · doi:10.1109/5.163414 · Cited by 664
iDistance: An adaptive B + -tree based indexing method for nearest neighbor search
Jagadish, H. V., Ooi, B. C., Tan, K.-L., Yu, C., & Zhang, R. (2005) · ACM Transactions on Database Systems · doi:10.1145/1071610.1071612 · Cited by 595
Navigability of complex networks
Boguñá, M., Krioukov, D., & Claffy, K. C. (2009) · Nature Physics · doi:10.1038/nphys1130 · Cited by 486
Approximate nearest neighbor algorithm based on navigable small world graphs
Malkov, Y., Ponomarenko, A., Logvinov, A., & Krylov, V. (2014) · Information Systems · doi:10.1016/j.is.2013.10.006 · Cited by 419
Optimized Product Quantization for Approximate Nearest Neighbor Search
Ge, T., He, K., Ke, Q., & Sun, J. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.379 · Cited by 384
Approximate nearest neighbor queries in fixed dimensions
Arya, S., & Mount, D. M. (1993) · doi:10.5555/313559.313768 · Cited by 303
FANNG: Fast Approximate Nearest Neighbour Graphs
Harwood, B., & Drummond, T. W. (2016) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2016.616 · Cited by 222
Query-aware locality-sensitive hashing for approximate nearest neighbor search
Huang, Q., Feng, J., Zhang, Y., Fang, Q., & Ng, W. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2850469.2850470 · Cited by 213
Efficient Indexing of Billion-Scale Datasets of Deep Descriptors
Yandex, A. B., & Lempitsky, V. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.226 · Cited by 186
Malkov, Y. A., & Yashunin, D. A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.09320 · Cited by 176
André, F., Kermarrec, A.-M., & Scouarnec, N. L. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2856318.2856324 · Cited by 129
Arora, A., Sinha, S., Kumar, P., & Bhattacharya, A. (2018) · Proceedings of the VLDB Endowment · doi:10.14778/3204028.3204034 · Cited by 109
EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN GraphPreprint
Fu, C., & Cai, D. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.07228 · Cited by 107
Self-citationLiu, Y., Cui, J., Huang, Z. H., Li, H., & Shen, H. T. (2014) · Proceedings of the VLDB Endowment · doi:10.14778/2732939.2732947 · Cited by 100
Efficient k-NN search on vertically decomposed data
de Vries, A. P., Mamoulis, N., Nes, N. J., & Kersten, M. L. (2002) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/564691.564729 · Cited by 82
LazyLSH: Approximate Nearest Neighbor Search for Multiple Distance Functions with a Single Index
Zheng, Y., Guo, Q., Tung, A. K. H., & Wu, S. (2016) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2882903.2882930 · Cited by 82
Gao, J., Jagadish, H. V., Lü, W., & Ooi, B. C. (2014) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2588555.2588565 · Cited by 59
Fast and unified local search for random walk based k-nearest-neighbor query in large graphs
Wu, Y., Jin, R., & Zhang, X. (2014) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/2588555.2610500 · Cited by 54
Fast and Accurate Hashing Via Iterative Nearest Neighbors Expansion
Jin, Z., Zhang, D., Hu, Y., Lin, S., Cai, D., & He, X. (2014) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2302018 · Cited by 52
Self-citationApproximate similarity search for online multimedia services on distributed CPU–GPU platforms
Teodoro, G., Junior, E. A. D. V., Mariano, N., Torres, R. D. S., Meira, W., & Saltz, J. H. (2013) · The VLDB Journal · doi:10.1007/s00778-013-0329-7 · Cited by 34
Monotonic Search Networks For Computer Vision Databases
Dearholt, D. W., Gonzales, N., & Kurup, G. (2005) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.1988.754602 · Cited by 30
Cited by
Billion-scale similarity search with GPUs
Johnson, J., Douze, M., & Jégou, H. (2017) · arXiv · doi:10.48550/arxiv.1702.08734 · Cited by 4,140
Billion-scale similarity search with GPUs
Johnson, J., Douze, M., & Jegou, H. (2021) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2019.2921572 · Cited by 4,228
Douze, M., Guzhva, A., Deng, C., Johnson, J., Szilvasy, G., Mazaré, P.-E., Lomeli, M., Hosseini, L., & Jégou, H. (2026) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2025.3618474 · Cited by 478
“In this example, we index 1.5 trillion vectors in 144 dimensions.”
Influential(2021) · doi:10.1145/3448016.3457550 · Cited by 416
Wang, M., Xu, X., Yue, Q., & Wang, Y. (2021) · Proceedings of the VLDB Endowment · doi:10.14778/3476249.3476255 · Cited by 264
Metadata
- Authors
- Fu, C., Xiang, C., Wang, C., & Cai, D.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2019-01
- Volume
- 12
- Issue
- 5
- Pages
- 461-474
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2963284996
- Cited by
- 379
- References
- 40
- FWCI
- 10.73
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.