You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@lucene.apache.org by "benwtrent (via GitHub)" <gi...@apache.org> on 2023/12/06 14:53:20 UTC
Re: [I] Use hash set for visited nodes in HNSW search? [LUCENE-10404] [lucene]
benwtrent commented on issue #11440:
URL: https://github.com/apache/lucene/issues/11440#issuecomment-1843050638
While exploring other things, I noticed this: https://github.com/apache/lucene/pull/12789
There is definitely room for improvement here. We should test:
- when to use Sparse vs. Fixed bit set
- At what point of percentage exploration should we even drop down to a IntHashMap. Though I am not sure that will ever be worth it when compared against a fixed bit set.
--
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