Re: [I] Should we use the new `expectedVisitedNodes` estimator to speed up filtered vector search? [lucene]

["tteofili (via GitHub)" <gi...@apache.org>]

tteofili commented on issue #14845:
URL: https://github.com/apache/lucene/issues/14845#issuecomment-3005177606

   imho, the heuristic from https://github.com/apache/lucene/pull/14836 is good enough for the sparse vs fixed bitset decision, whereas it might be a bit too naive for the case of filtered search e.g., as per comment, we should probably take `maxConn` into account. 
   nevertheless it might be just better than what we have today (perLeafK), so it's probably worth a try.


-- 
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-unsubscribe@lucene.apache.org

For queries about this service, please contact Infrastructure at:
users@infra.apache.org


---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscribe@lucene.apache.org
For additional commands, e-mail: issues-help@lucene.apache.org