Back to papers
DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search
Summary: DARTH enables declarative recall targets for approximate nearest neighbor search by embedding adaptive early termination into the search process. It reduces tuning effort and achieves large speedups (HNSW up to 14.6x; IVF up to 41.8x) while meeting user recall targets.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 7318
- Venue
- SIGMOD
- Year
- 2026
- Pagerank
- 4.3577746e-05
- Overall Rank
- 9,296 | 35.40%
- DOI
-
10.1145/3749160
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
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 |
| 183 |
Automatic Database Management System Tuning Through Large-scale Machine Learning |
2017 |
SIGMOD |
0.00036859633 |
| 210 |
Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph |
2019 |
VLDB |
0.00034086264 |
| 494 |
Milvus: A Purpose-Built Vector Data Management System |
2021 |
SIGMOD |
0.00021769407 |
| 596 |
Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search |
2016 |
VLDB |
0.00019455943 |
| 730 |
AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data |
2020 |
VLDB |
0.00017443615 |
| 763 |
A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search |
2021 |
VLDB |
0.00016963981 |
| 1,347 |
Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination |
2020 |
SIGMOD |
0.00012463441 |
| 2,287 |
RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search |
2024 |
SIGMOD |
9.1004806e-05 |
| 3,199 |
Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search |
2020 |
VLDB |
7.3999833e-05 |
| 3,403 |
ELPIS: Graph-Based Similarity Search for Scalable Data Science |
2023 |
VLDB |
7.1338786e-05 |
| 4,622 |
Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art |
2025 |
SIGMOD |
6.0356382e-05 |
| 5,186 |
SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search |
2025 |
SIGMOD |
5.6352814e-05 |
| 5,559 |
LANNS: A Web-Scale Approximate Nearest Neighbor Lookup System |
2022 |
VLDB |
5.437026e-05 |
| 5,747 |
Hercules Against Data Series Similarity Search |
2022 |
VLDB |
5.3427166e-05 |
| 6,375 |
DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search |
2024 |
VLDB |
5.0868008e-05 |
| 7,090 |
Dumpy: A Compact and Adaptive Index for Large Data Series Collections |
2023 |
SIGMOD |
4.8318862e-05 |
| 7,307 |
Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes |
2024 |
VLDB |
4.7623207e-05 |
| 7,848 |
Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search |
2025 |
SIGMOD |
4.6323445e-05 |
| 9,208 |
Odyssey: A Journey in the Land of Distributed Data Series Similarity Search |
2023 |
VLDB |
4.3693005e-05 |
| 9,233 |
LeaFi: Data Series Indexes on Steroids with Learned Filters |
2025 |
SIGMOD |
4.3648789e-05 |
Semantically Similar Papers