Jackie-Jiang commented on issue #17336: URL: https://github.com/apache/pinot/issues/17336#issuecomment-3648237230
Can you also try out the `BitSet` which guarantees `O(1)` complexity per insert? I feel the tradeoff is between: - Memory: `RoaringBitmap` has better compaction with less insert on a wider search space - Performance: Besides the allocation, `BitSet` has more guaranteed performance Currently `RoaringBitmap` is used to reduce the dictionary lookup. For low cardinality, `BitSet` might always outperform `RoaringBitmap`. For high cardinality, when the same dictionary id repeats a lot, directly inserting into HLL might produce worse performance -- 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]
