benwtrent commented on PR #12794:
URL: https://github.com/apache/lucene/pull/12794#issuecomment-1808282034
@mayya-sharipova two important measurements we need to check here:
- When comparing baseline & candidate, can the `candidate` get to higher
recall than baseline with lower latency?
- When using the same query parameters (fanout, k, etc.), how does
`candidate` measure against a fully merged graph (1 segment)? I am guessing a
single graph (at least when using only one search thread), will always be
faster, I am just wondering by how much.
--
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
