akhilesh-k opened a new pull request, #15070: URL: https://github.com/apache/lucene/pull/15070
**Description** This PR updates the decision logic in filtered vector search to leverage the new `expectedVisitedNodes(int k, int size)` heuristic introduced in #14836. The existing flow for filtered vector search is discussed in this issue comment: https://github.com/apache/lucene/issues/14845#issue-3175422512 The previous heuristic `filterCost <= perLeafK` for triggering exact search could cause unnecessary approximate searches which may stop early due to `filterCost <= expectedVisitedNodes(perLeafK, size)` and then require a fallback exact search. By using `expectedVisitedNodes`, which estimates the number of visited nodes based on both k and graph size, we can more accurately predict query cost and bypass unnecessary approximate searches. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org --------------------------------------------------------------------- To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org For additional commands, e-mail: issues-h...@lucene.apache.org
