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: hc315d15d7954fb3f
Venue: SIGMOD
Year: 2026
Pagerank: 5.2224279e-05
Overall Rank: 9,136 | 38.58%
DOI: 10.1145/3749160

Incoming Non-self Citations Over Time

Authors

1. Manos Chatzakis (Université Paris Cité)
2. Yannis Papakonstantinou (Google)
3. Themis Palpanas (Université Paris Cité)

BibTeX Citation

@inproceedings{chatzakis_sigmod26,
        title = {{DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search}},
        author = {Chatzakis, Manos and Papakonstantinou, Yannis and Palpanas, Themis},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3749160},
        url = {https://dl.acm.org/doi/10.1145/3749160},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
9,560	Distribution-Aware Exploration for Adaptive HNSW Search	2026	SIGMOD	5.1571823e-05
10,409	An In-Depth Study of Filter-Agnostic Vector Search on a PostgreSQL Database System: [Experiments & Analysis]	2026	SIGMOD	4.9793485e-05
10,509	TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search	2026	SIGMOD	4.9793485e-05
10,540	Accelerating High-Dimensional ANN Search via Skipping Redundant Distance Computations	2026	SIGMOD	4.9793485e-05
10,848	QBAT: Model-based Query Budget Autotuner for Clustering-based Approximate Nearest Neighbor Search	2026	VLDB	4.9793485e-05
10,900	ANNiE: A Learned Query Cost Estimator for Graph-Based Approximate Nearest Neighbor Search	2026	VLDB	4.9793485e-05
11,028	Advances of Query Processing in Vector Databases	2026	VLDB	4.9793485e-05

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
74	Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph	2019	VLDB	0.00037091678
78	Automatic Database Management System Tuning Through Large-scale Machine Learning	2017	SIGMOD	0.00036684414
194	Milvus: A Purpose-Built Vector Data Management System	2021	SIGMOD	0.00025636725
298	Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search	2016	VLDB	0.00021833987
341	AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data	2020	VLDB	0.00020539791
345	A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search	2021	VLDB	0.00020445545
804	RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search	2024	SIGMOD	0.00013832333
839	Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination	2020	SIGMOD	0.00013547412
2,265	ELPIS: Graph-Based Similarity Search for Scalable Data Science	2023	VLDB	8.7238222e-05
2,730	Return of the Lernaean Hydra: Experimental Evaluation of Data Series Approximate Similarity Search	2020	VLDB	8.0861221e-05
2,871	Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art	2025	SIGMOD	7.9229231e-05
3,385	SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search	2025	SIGMOD	7.3548612e-05
4,598	Steiner-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes	2024	VLDB	6.5086378e-05
5,007	LANNS: A Web-Scale Approximate Nearest Neighbor Lookup System	2022	VLDB	6.3169238e-05
5,313	Hercules Against Data Series Similarity Search	2022	VLDB	6.1846986e-05
5,527	DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search	2024	VLDB	6.0936219e-05
6,609	Dumpy: A Compact and Adaptive Index for Large Data Series Collections	2023	SIGMOD	5.7354155e-05
7,264	Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search	2025	SIGMOD	5.5703557e-05
9,440	Odyssey: A Journey in the Land of Distributed Data Series Similarity Search	2023	VLDB	5.1771634e-05
9,563	LeaFi: Data Series Indexes on Steroids with Learned Filters	2025	SIGMOD	5.1571823e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	74	Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph	2019	VLDB
2	10,078	Accelerating Approximate Nearest Neighbor Search in Hierarchical Graphs: Efficient Level Navigation with Shortcuts	2025	VLDB
3	10,900	ANNiE: A Learned Query Cost Estimator for Graph-Based Approximate Nearest Neighbor Search	2026	VLDB
4	10,540	Accelerating High-Dimensional ANN Search via Skipping Redundant Distance Computations	2026	SIGMOD
5	9,560	Distribution-Aware Exploration for Adaptive HNSW Search	2026	SIGMOD
6	345	A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search	2021	VLDB
7	10,827	Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization	2026	VLDB
8	6,239	Efficient Data-aware Distance Comparison Operations for High-Dimensional Approximate Nearest Neighbor Search	2025	VLDB
9	10,323	Dynamically Detect and Fix Hardness for Efficient Approximate Nearest Neighbor Search	2026	SIGMOD
10	839	Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination	2020	SIGMOD