benwtrent commented on issue #12505: URL: https://github.com/apache/lucene/issues/12505#issuecomment-1805659612
One thing to consider is that we should test some various graphs to see how many vectors we actually visit. I suspect its around `Math.log(graphSize) * vectorsCollected`. We could use some derivative of this equation to determine if we should use brute force or not. For testing purposes, since we want to verify graph exploration, etc. all work without having to build huge indices, we might have an "override" to always do HNSW search first. -- 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
