jpountz commented on PR #12789: URL: https://github.com/apache/lucene/pull/12789#issuecomment-1804146598
I can believe that FixedBitSet is faster in some cases, but it's surprising to me that the memory usage of SparseFixedBitSet can go up to 2x that of FixedBitSet, this makes me wonder if `SparseFixedBitSet#ramBytesUsed` is buggy. A SparseFixedBitSet that has all its bits set (worst-case scenario for memory usage) has an overhead of one long, one object reference and and one array every 4096 bits = 64 longs, which doesn't feel to me it should ever use 2x more heap? Separately, I wonder if you know the number of nodes that get visited (ie. the number of bits that end up being set) in your benchmark? Is it a force-merged index or do you have multiple segments? -- 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: [email protected] For queries about this service, please contact Infrastructure at: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
