DBScholar

Back to papers

Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes

Summary: Steiner-hardness: a graph-native, connection-based measure of query difficulty for graph-based ANN, modeling minimal query effort on a representative graph. Reducible to Directed Steiner Tree so DST solvers compute it efficiently; outperforms LID in predicting actual query effort and yields unbiased index rankings. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13899
Venue
VLDB
Year
2024
Pagerank
5.9593368e-05
Overall Rank
6,148 | 57.83%
DOI
10.14778/3704965.3704974

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{wang_vldb24,
        title = {{Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes}},
        author = {Wang, Zeyu and Wang, Qitong and Cheng, Xiaoxing and Wang, Peng and Palpanas, Themis and Wang, Wei},
        journal = {PVLDB},
        series = {{VLDB} '24},
        volume = {17},
        number = {13},
        pages = {4668--4682},
        doi = {10.14778/3704965.3704974},
        url = {https://doi.org/10.14778/3704965.3704974},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Rank Citing Paper Year Venue Pagerank
3,335 Navigating Labels and Vectors: A Unified Approach to Filtered Approximate Nearest Neighbor Search 2024 SIGMOD 7.5098031e-05
7,145 Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search 2025 SIGMOD 5.6908957e-05
9,145 SIEVE: Effective Filtered Vector Search with Collection of Indexes 2025 VLDB 5.3150984e-05
9,360 DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search 2026 SIGMOD 5.2819088e-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,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,362 Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search 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,443 Distribution-Aware Exploration for Adaptive HNSW Search 2026 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 28 of 28 cited papers.

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

Rank Cited Paper Year Venue Pagerank
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
286 Milvus: A Purpose-Built Vector Data Management System 2021 SIGMOD 0.00022357911
332 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00020920444
369 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.00019945234
398 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00019194947
406 AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data 2020 VLDB 0.00019054532
705 HD-Index: Pushing the Scalability-Accuracy Boundary for Approximate kNN Search in High-Dimensional Spaces 2018 VLDB 0.00014829964
926 Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination 2020 SIGMOD 0.00013181732
1,084 A Data-adaptive and Dynamic Segmentation Index for Whole Matching on Time Series 2013 VLDB 0.00012256753
1,244 Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases 2023 SIGMOD 0.00011508159
1,357 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 0.00011043994
1,546 PM-LSH: A Fast and Accurate LSH Framework for High-Dimensional Approximate NN Search 2020 VLDB 0.00010407159
1,589 Manu: A Cloud Native Vector Database Management System 2022 VLDB 0.00010264469
1,735 High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations 2023 SIGMOD 9.9004924e-05
1,802 HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search 2022 VLDB 9.7284341e-05
1,934 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 9.4561907e-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,627 Pivot-based Metric Indexing 2017 VLDB 6.5963674e-05
4,965 LANNS: A Web-Scale Approximate Nearest Neighbor Lookup System 2022 VLDB 6.4241124e-05
5,231 Hercules Against Data Series Similarity Search 2022 VLDB 6.3068064e-05
5,800 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 6.0850924e-05
6,691 Dumpy: A Compact and Adaptive Index for Large Data Series Collections 2023 SIGMOD 5.8011086e-05
9,278 Odyssey: A Journey in the Land of Distributed Data Series Similarity Search 2023 VLDB 5.2936898e-05
11,233 CIVET: Exploring Compact Index for Variable-Length Subsequence Matching on Time Series 2024 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 93 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB
2 10,454 Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search 2026 SIGMOD
3 398 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB
4 3,261 Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity 2015 SIGMOD
5 10,227 Efficient Index Layout and Search Strategy for Large-scale High-dimensional Vector Similarity Search 2026 SIGMOD
6 10,447 Efficient and Robust Out-Of-Distribution Vector Similarity Search with Cross-Distribution Monotonic Graph 2026 SIGMOD
7 1,934 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB
8 1,244 Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases 2023 SIGMOD
9 9,892 Accelerating Approximate Nearest Neighbor Search in Hierarchical Graphs: Efficient Level Navigation with Shortcuts 2025 VLDB
10 10,362 Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search 2026 SIGMOD