FrankChen021 commented on issue #12734: URL: https://github.com/apache/druid/issues/12734#issuecomment-1174555329
Calculating cardinality in short time on large volume data is challengeable. We had similar implementation based on roaringbitmap too, but the problem is even the serialization & deserialization of roaringbitmap is fast enough, they're still bottleneck when calculating high cardinality data. Another problem is during query there will be too many bitmap object creation which will put heavy load on garbage collection. So, I'm more care about the performance of such implementation. Do you have any reports that can be shared with us? -- 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]
