Database Paper Browser

Back to papers

Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search

Summary: Propose Escape Hardness, a per-query metric to locate defective regions in graph-based ANNS and a two-stage online repair that fixes them on-the-fly without bipartite graphs or costly rebuilds. RFix (entry) and NGFix (vicinity) improve OOD robustness and speed (up to 2.25×). (summarized by gpt-5-mini on Feb 11 2026)

Paper ID
7379
Venue
SIGMOD
Year
2026
Pagerank
4.1945683e-05
Overall Rank
10,071 | 29.94%
DOI
10.1145/3769783

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 22 of 22 cited papers.

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

Rank Cited Paper Year Venue Pagerank
212 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00033913475
770 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00016917602
1,010 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00014652858
1,269 Cache locality is not enough: High-Performance Nearest Neighbor Search with Product Quantization Fast Scan 2016 VLDB 0.00012930432
1,364 Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination 2020 SIGMOD 0.00012370117
2,023 Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases 2023 SIGMOD 9.7544991e-05
2,181 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 9.3451821e-05
2,324 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 9.0326444e-05
2,690 Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment 2024 SIGMOD 8.293714e-05
2,725 HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search 2022 VLDB 8.2294908e-05
2,811 High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations 2023 SIGMOD 8.0806307e-05
2,971 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 7.7970531e-05
3,400 ELPIS: Graph-Based Similarity Search for Scalable Data Science 2023 VLDB 7.1405533e-05
4,598 Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search 2025 SIGMOD 6.0586236e-05
4,731 Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art 2025 SIGMOD 5.966659e-05
5,184 SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search 2025 SIGMOD 5.6406991e-05
5,233 RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search 2024 VLDB 5.6131833e-05
6,376 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 5.0916875e-05
7,239 Efficient Data-aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search 2025 VLDB 4.792836e-05
7,316 Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes 2024 VLDB 4.7640297e-05
7,606 Tribase: A Vector Data Query Engine for Reliable and Lossless Pruning Compression using Triangle Inequalities 2025 SIGMOD 4.6967106e-05
7,843 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 4.6367909e-05
Previous Page 1 / 1 Next

Semantically Similar Papers