benwtrent opened a new issue, #12505:
URL: https://github.com/apache/lucene/issues/12505
### Description
Lucene always does an approximate nearest neighbors search when no filter is
provided.
This seems like unnecessary work. Some benchmarks would have to be done, but
some ideas I had around options to explore:
- Why not always do exact when `maxDoc < k`?
- Should the "when to do exact" calculation consider `byte` vs `float`
vectors?
It seems weird to go through all the work of going to the graph if there are
only 10 documents in a segment.
--
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.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
