[GitHub] [datasketches-java] AlexanderSaydakov commented on issue #357: Performance comparison between DoubleSketch and QuantileSketch

[GitBox <gi...@apache.org>]

AlexanderSaydakov commented on issue #357:
URL: https://github.com/apache/datasketches-java/issues/357#issuecomment-889367657


   You seem to suggest that the sketches are based on the same algorithm, but it is not the case. The algorithm is not even similar, the definition of error is different too, and I don't see much similarity in the API. For instance, DDSketch has a method to get a value given a rank (quantile), but not the other way around.
   The DataSketches DoublesSketch is a specialized implementation for primitive double values, but the algorithm does not assume numeric input. There is a generic implementation for arbitrary types. Besides, we have a better algorithm now. See the KLL sketch. It has a specialized implementation for float values, and no generic implementation (in Java, yet). Also for relative error we have the REQ sketch. Perhaps, it might be possible to do some comparison, but it is even hard to decide which ones are closer in functionality.


-- 
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: commits-unsubscribe@datasketches.apache.org

For queries about this service, please contact Infrastructure at:
users@infra.apache.org



---------------------------------------------------------------------
To unsubscribe, e-mail: commits-unsubscribe@datasketches.apache.org
For additional commands, e-mail: commits-help@datasketches.apache.org