You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@lucene.apache.org by "Michael Sokolov (Jira)" <ji...@apache.org> on 2021/03/15 21:41:00 UTC

[jira] [Created] (LUCENE-9847) Should we use a FixedBitSet to track visited nodes in HnswGraph.search?

Michael Sokolov created LUCENE-9847:
---------------------------------------

             Summary: Should we use a FixedBitSet to track visited nodes in HnswGraph.search?
                 Key: LUCENE-9847
                 URL: https://issues.apache.org/jira/browse/LUCENE-9847
             Project: Lucene - Core
          Issue Type: Improvement
            Reporter: Michael Sokolov


Let's compare the cost/benefit tradeoff of using full BitSet in HnswGraph.search. This idea was motivated by the large number of heap allocations due to SparseFixedBitSet used in graph search that we see in profiler output. We could manage a pool of full BitSets in order to minimize allocations there, and probably gain some performance with a modest expenditure of heap.



--
This message was sent by Atlassian Jira
(v8.3.4#803005)

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