graph-based-ANN-paper-list

1. how to build graph

1. Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2018
2. Approximate nearest neighbor search on high dimensional data—experiments, analyses, and improvement 2016
3. Approximate nearest neighbor algorithm based on navigable small world graphs. 2014
4. FANNG: Fast approximate nearest neighbour graphs 2016
5. Hierarchical clustering-based graphs for large scale nearest neighbor search. 2019
6. efficient approximate nearest neighbor search in multi-dimensional databases 2023
7. Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs 2016
8. Relative NN-Descent: A Fast Index Construction for Graph-Based Approximate Nearest Neighbor Search
9. Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search 2024
10. Efanna: An extremely fast approximate nearest neighbor search algorithm based on knn graph
11. Bridging Speed and Accuracy to Approximate K-Nearest Neighbor Search
12. Möbius Transformation for Fast Inner Product Search on Graph
13. Norm Adjusted Proximity Graph for Fast Inner Product Retrieval

2. using SSD

1. DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node 2019
2. HM-ANN: Efficient Billion-Point Nearest Neighbor Search on Heterogeneous Memory 2020
3. FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search
4. Processing-In-Hierarchical-Memory Architecture for Billion-Scale Approximate Nearest Neighbor Search 2023

3. using GPU

1. GGNN: Graph-Based GPU Nearest Neighbor Search 2023
2. SONG: Approximate Nearest Neighbor Search on GPU 2020
3. GPU-accelerated Proximity Graph Approximate Nearest Neighbor Search and Construction 2022
4. Cagra: Highly parallel graph construction and approximate nearest neighbor search for gpus 2023
5. BANG: Billion-Scale Approximate Nearest Neighbor Search using a Single GPU 2024
6. Fast k-NN Graph Construction by GPU based NN-Descent
7. Dynamic NN-Descent: An Efficient k-NN Graph Construction Method

4. distribution

5. with other ANN method

1. Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces
2. Quantization to speedup approximate nearest neighbor search
3. ELIPIS: graph-based similarity search for scalable data science

6. hybrid search

1. Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints
2. SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search
3. An efficient and robust framework for approximate nearest neighbor search with attribute constraint
4. CAPS: A Practical Partition Index for Filtered Similarity Search

7. streaming & update

1. SWINN: Efficient nearest neighbor search in sliding windows using graphs
2. FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search
3. Fast k-NN Graph Construction by GPU based NN-Descent

8. efficient query

1. iQAN: Fast and Accurate Vector Search with Efficient Intra-Query Parallelism on Multi-Core Architectures