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
7101
Venue
SIGMOD
Year
2025
Pagerank
7.6071649e-05
Overall Rank
3,240 | 77.78%
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 24 of 24 citing papers.

Rank Citing Paper Year Venue Pagerank
6,334 MIRAGE-ANNS: Mixed Approach Graph-based Indexing for Approximate Nearest Neighbor Search 2025 SIGMOD 5.9093559e-05
6,615 A Topology-Aware Localized Update Strategy for Graph-Based ANN Index 2026 VLDB 5.8214312e-05
7,145 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 5.6908957e-05
9,360 DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search 2026 SIGMOD 5.2819088e-05
9,377 LeaFi: Data Series Indexes on Steroids with Learned Filters 2025 SIGMOD 5.2755515e-05
9,407 RWalks: Random Walks as Attribute Diffusers for Filtered Vector Search 2025 SIGMOD 5.2751121e-05
10,179 Proximity Graphs for Similarity Search: Fast Construction, Lower Bounds, and Euclidean Separation 2026 PODS 5.093636e-05
10,193 An In-Depth Study of Filter-Agnostic Vector Search on a PostgreSQL Database System: [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,209 CMANNS: GPU-Accelerated Graph Index Construction for ANNS via Compute-Memory Disaggregation 2026 SIGMOD 5.093636e-05
10,279 PathSeer: Adaptive Neighbor Handling for Efficient Filtered ANN Search 2026 SIGMOD 5.093636e-05
10,297 TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
10,299 Through the Lens of Hubness: A Revisit on Graph-Based Approximate Nearest Neighbor Search: [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,336 Accelerating High-Dimensional ANN Search via Skipping Redundant Distance Computations 2026 SIGMOD 5.093636e-05
10,362 Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
10,381 Integrating Vector Databases across Embedding Models 2026 SIGMOD 5.093636e-05
10,417 WoW: A Window-to-Window Incremental Index for Range-Filtering Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
10,435 CANDOR-Bench: Benchmarking In-Memory Continuous ANNS under Dynamic Open-World Streams [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,443 Distribution-Aware Exploration for Adaptive HNSW Search 2026 SIGMOD 5.093636e-05
10,454 Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
10,455 FGIM: a Fast Graph-based Indexes Merging Framework for Approximate Nearest Neighbor Search 2026 SIGMOD 5.093636e-05
10,493 Reveal Hidden Pitfalls and Navigate Next Generation of Vector Similarity Search from Task-Centric Views: [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,544 I/O Optimizations for Graph-Based Disk-Resident Approximate Nearest Neighbor Search: A Design Space Exploration 2026 VLDB 5.093636e-05
10,563 Balancing the Blend: An Experimental Analysis of Trade-offs in Hybrid Search 2026 VLDB 5.093636e-05
10,571 An Experimental Evaluation of Hybrid Querying on Vectors 2026 VLDB 5.093636e-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.0020210012
4 The R*-tree: An Efficient and Robust Access Method for Points and Rectangles 1990 SIGMOD 0.001157935
21 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00056760516
93 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00034701237
190 Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases 2001 SIGMOD 0.00026105472
332 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00020920444
398 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00019194947
489 Distributed Representations of Tuples for Entity Resolution 2018 VLDB 0.0001761456
580 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016157635
705 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00014829964
1,802 HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search 2022 VLDB 9.7284341e-05
2,346 Series2Graph: Graph-based Subsequence Anomaly Detection for Time Series 2020 VLDB 8.7168932e-05
2,534 ELPIS: Graph-Based Similarity Search for Scalable Data Science 2023 VLDB 8.4561875e-05
2,734 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB 8.190416e-05
3,037 The Lernaean Hydra of Data Series Similarity Search: An Experimental Evaluation of the State of the Art 2019 VLDB 7.8275859e-05
3,486 Scalable, Variable-Length Similarity Search in Data Series: The ULISSE Approach 2018 VLDB 7.3696676e-05
4,212 Data Series Progressive Similarity Search with Probabilistic Quality Guarantees 2020 SIGMOD 6.8283344e-05
4,665 Coconut: A Scalable Bottom-Up Approach for Building Data Series Indexes 2018 VLDB 6.5780693e-05
4,970 Permutation Search Methods are Efficient, Yet Faster Search is Possible 2015 VLDB 6.4197336e-05
6,093 High-Dimensional Vector Similarity Search: From Time Series to Deep Network Embeddings 2020 SIGMOD 5.978635e-05
9,278 Odyssey: A Journey in the Land of Distributed Data Series Similarity Search 2023 VLDB 5.2936898e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 10,493 Reveal Hidden Pitfalls and Navigate Next Generation of Vector Similarity Search from Task-Centric Views: [Experiments & Analysis] 2026 SIGMOD
2 10,381 Integrating Vector Databases across Embedding Models 2026 SIGMOD
3 10,346 Beyond Vector Search: Querying With and Without Predicates 2026 SIGMOD
4 1,631 High-Throughput Vector Similarity Search in Knowledge Graphs 2023 SIGMOD
5 398 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB
6 10,227 Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search 2026 SIGMOD
7 3,265 New Trends in High-D Vector Similarity Search: AI-driven, Progressive, and Distributed 2021 VLDB
8 2,519 Similarity search in the blink of an eye with compressed indices 2023 VLDB
9 10,447 Efficient and Robust Out-Of-Distribution Vector Similarity Search with Cross-Distribution Monotonic Graph 2026 SIGMOD
10 10,571 An Experimental Evaluation of Hybrid Querying on Vectors 2026 VLDB