DBScholar

Back to papers

Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art

Summary: Large-scale survey and evaluation of in-memory graph-based vector search, comparing 12 methods on up to 1B vectors. Five paradigms—seed, incremental insertion, neighborhood propagation, diversification, divide-and-conquer—frame the space; incremental insertion and diversification perform best, base-graph choice hurts scalability, and data-adaptive seeding/diversification is a key future direction. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hfabd0b19047ed156
Venue
SIGMOD
Year
2025
Pagerank
7.9191725e-05
Overall Rank
2,872 | 80.70%
DOI
10.1145/3709693

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{azizi_sigmod25,
        title = {{Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art}},
        author = {Azizi, Ilias and Echihabi, Karima and Palpanas, Themis},
        series = {{SIGMOD} '25},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3709693},
        url = {https://dl.acm.org/doi/10.1145/3709693},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 29 of 29 citing papers.

Rank Citing Paper Year Venue Pagerank
5,620 A Topology-Aware Localized Update Strategy for Graph-Based ANN Index 2026 VLDB 6.0596841e-05
5,886 MIRAGE-ANNS: Mixed Approach Graph-based Indexing for Approximate Nearest Neighbor Search 2025 SIGMOD 5.955484e-05
6,467 Integrating Vector Databases across Embedding Models 2026 SIGMOD 5.7729149e-05
7,267 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 5.5677188e-05
7,308 RWalks: Random Walks as Attribute Diffusers for Filtered Vector Search 2025 SIGMOD 5.5559693e-05
9,146 DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search 2026 SIGMOD 5.2199557e-05
9,568 Distribution-Aware Exploration for Adaptive HNSW Search 2026 SIGMOD 5.154741e-05
9,571 LeaFi: Data Series Indexes on Steroids with Learned Filters 2025 SIGMOD 5.154741e-05
10,330 Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search 2026 SIGMOD 5.0322912e-05
10,332 WoW: A Window-to-Window Incremental Index for Range-Filtering Approximate Nearest Neighbor Search 2026 SIGMOD 5.0322912e-05
10,333 Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search 2026 SIGMOD 5.0322912e-05
10,407 Proximity Graphs for Similarity Search: Fast Construction, Lower Bounds, and Euclidean Separation 2026 PODS 4.9769913e-05
10,421 An In-Depth Study of Filter-Agnostic Vector Search on a PostgreSQL Database System: [Experiments & Analysis] 2026 SIGMOD 4.9769913e-05
10,437 CMANNS: GPU-Accelerated Graph Index Construction for ANNS via Compute-Memory Disaggregation 2026 SIGMOD 4.9769913e-05
10,502 PathSeer: Adaptive Neighbor Handling for Efficient Filtered ANN Search 2026 SIGMOD 4.9769913e-05
10,520 TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search 2026 SIGMOD 4.9769913e-05
10,522 Through the Lens of Hubness: A Revisit on Graph-Based Approximate Nearest Neighbor Search: [Experiments & Analysis] 2026 SIGMOD 4.9769913e-05
10,551 Accelerating High-Dimensional ANN Search via Skipping Redundant Distance Computations 2026 SIGMOD 4.9769913e-05
10,635 CANDOR-Bench: Benchmarking In-Memory Continuous ANNS under Dynamic Open-World Streams [Experiments & Analysis] 2026 SIGMOD 4.9769913e-05
10,653 FGIM: a Fast Graph-based Indexes Merging Framework for Approximate Nearest Neighbor Search 2026 SIGMOD 4.9769913e-05
10,691 Reveal Hidden Pitfalls and Navigate Next Generation of Vector Similarity Search from Task-Centric Views: [Experiments & Analysis] 2026 SIGMOD 4.9769913e-05
10,736 I/O Optimizations for Graph-Based Disk-Resident Approximate Nearest Neighbor Search: A Design Space Exploration 2026 VLDB 4.9769913e-05
10,755 Balancing the Blend: An Experimental Analysis of Trade-offs in Hybrid Search 2026 VLDB 4.9769913e-05
10,763 An Experimental Evaluation of Hybrid Querying on Vectors 2026 VLDB 4.9769913e-05
10,839 RNSG: A Range-Aware Graph Index for Efficient Range-Filtered Approximate Nearest Neighbor Search 2026 VLDB 4.9769913e-05
10,846 HEXA: A Disjoint-Subgraph-Based Indexing Framework for Approximate Nearest Neighbor Search at Billion Scale 2026 VLDB 4.9769913e-05
10,860 GAS: A Lightweight Framework for Filtered Search over Wide-table Vectors 2026 VLDB 4.9769913e-05
10,883 BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector 2026 VLDB 4.9769913e-05
10,909 ANNiE: A Learned Query Cost Estimator for Graph-Based Approximate Nearest Neighbor Search 2026 VLDB 4.9769913e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 21 of 21 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
2 R-Trees: A Dynamic Index Structure For Spatial Searching 1984 SIGMOD 0.0019923528
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.0011402175
20 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.0005758001
74 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00037145866
194 Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases 2001 SIGMOD 0.00025637823
297 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00021849337
344 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00020455839
457 Distributed Representations of Tuples for Entity Resolution 2018 VLDB 0.00017899824
562 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016350316
648 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00015156941
1,681 HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search 2022 VLDB 9.8836287e-05
2,264 ELPIS: Graph-Based Similarity Search for Scalable Data Science 2023 VLDB 8.7286407e-05
2,376 Series2Graph: Graph-based Subsequence Anomaly Detection for Time Series 2020 VLDB 8.5517908e-05
2,730 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB 8.0842027e-05
2,870 The Lernaean Hydra of Data Series Similarity Search: An Experimental Evaluation of the State of the Art 2019 VLDB 7.919641e-05
3,513 Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach 2018 VLDB 7.2404521e-05
4,305 Data Series Progressive Similarity Search with Probabilistic Quality Guarantees 2020 SIGMOD 6.6740088e-05
4,685 Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes 2018 VLDB 6.4692031e-05
4,887 Permutation Search Methods are Efficient, Yet Faster Search is Possible 2015 VLDB 6.3673794e-05
6,184 High-Dimensional Vector Similarity Search: From Time Series to Deep Network Embeddings 2020 SIGMOD 5.8567387e-05
9,449 Odyssey: A Journey in the Land of Distributed Data Series Similarity Search 2023 VLDB 5.1747125e-05
Previous Page 1 / 1 Next

Semantically Similar Papers