AlexanderSaydakov commented on issue #7269: URL: https://github.com/apache/druid/issues/7269#issuecomment-799782906
If by "this front" you mean CPC sketch aggregator in Druid, then a simple answer is "no". The requirement of operating in a fixed chunk of memory that is preallocated by a BufferAggregator is quite limiting. Some sketch algorithms are more friendly to this mode of operation, some other algorithms have to be coerced quite a bit, and can sometimes exceed a given limit, which leads to moving a particular sketch out of a given off-heap slot. This happens with quantiles sketch, for example. This mode of operation can change all sorts of trade-offs in an algorithm and make it essentially a different algorithm. We are not sure how to approach this with CPC sketch. There is still no off-heap implementation of it. ---------------------------------------------------------------- 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. For queries about this service, please contact Infrastructure at: [email protected] --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
