DBScholar

Back to papers

ANNiE: A Learned Query Cost Estimator for Graph-Based Approximate Nearest Neighbor Search

Summary: ANNiE introduces learned cost estimation for graph-based ANNS, predicting effort to meet a target recall with probabilistic guarantees. Its cost-based search, ANNiE-S, automatically meets per-query recall targets and delivers 2.3× speedups. (summarized by gpt-5.6-luna on Aug 28 2026)

Paper ID
he29ece22e91bf7e5
Venue
VLDB
Year
2026
Pagerank
4.9769913e-05
Overall Rank
10,909 | 26.68%
DOI
10.14778/3836663.3836728
PDF
Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{wang_vldb26,
        title = {{ANNiE: A Learned Query Cost Estimator for Graph-Based Approximate Nearest Neighbor Search}},
        author = {Wang, Zeyu and Chatzakis, Manos and Wang, Qitong and Palpanas, Themis and Wang, Peng and Wang, Wei},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {11},
        pages = {3820--3833},
        doi = {10.14778/3836663.3836728},
        url = {https://doi.org/10.14778/3836663.3836728},
        year = {2026}
}

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 20 of 20 cited papers.

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

Rank Cited Paper Year Venue Pagerank
1 Access Path Selection in a Relational Database Management System 1979 SIGMOD 0.0023943337
74 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00037145866
189 Milvus: A Purpose-Built Vector Data Management System 2021 SIGMOD 0.0002585319
344 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00020455839
803 RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search 2024 SIGMOD 0.00013838349
838 Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination 2020 SIGMOD 0.0001355054
981 Cardinality Estimation in DBMS: A Comprehensive Benchmark Evaluation 2022 VLDB 0.00012713454
1,061 Approximate Query Processing: No Silver Bullet 2017 SIGMOD 0.00012208639
1,465 Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities 2019 SIGMOD 0.00010572023
1,600 High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations 2023 SIGMOD 0.00010111099
2,264 ELPIS: Graph-Based Similarity Search for Scalable Data Science 2023 VLDB 8.7286407e-05
2,730 Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search 2020 VLDB 8.0842027e-05
2,872 Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art 2025 SIGMOD 7.9191725e-05
4,305 Data Series Progressive Similarity Search with Probabilistic Quality Guarantees 2020 SIGMOD 6.6740088e-05
4,600 Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes 2024 VLDB 6.5055567e-05
5,530 DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search 2024 VLDB 6.0907372e-05
5,717 Tribase: A Vector Data Query Engine for Reliable and Lossless Pruning Compression using Triangle Inequalities 2025 SIGMOD 6.0166864e-05
6,612 Dumpy: A Compact and Adaptive Index for Large Data Series Collections 2023 SIGMOD 5.732933e-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
Previous Page 1 / 1 Next

Semantically Similar Papers