A machine-learned router predicts per-query recall for filtered ANN methods and selects the recall-QPS optimal one, outperforming fixed baselines on five unseen datasets.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Query-aware Routing for Filtered Approximate Nearest Neighbors Search
A machine-learned router predicts per-query recall for filtered ANN methods and selects the recall-QPS optimal one, outperforming fixed baselines on five unseen datasets.