Viewing profile — oertl

[flagged]

The algorithm is simple, which is why it is also suitable for textbooks. However, it is far from representing the state of the art. In case you are interested in the latest develop…

The newest version of the hash4j Java library (https://github.com/dynatrace-oss/hash4j) introduces UltraLogLog, a new data sketch for approximate distinct counting that uses 22% le…

FYI, already in 2015, I have proposed exactly the same idea as improvement to HdrHistogram. See https://github.com/HdrHistogram/HdrHistogram/issues/54 and corresponding code https:…

Sure, send me an email.

I have not yet checked their ML approach. Regarding register updates you are right. I have also seen that they did only 10000 simulation runs to determine the standard deviation to…

The tailcut approach breaks one important property of cardinality estimation algorithms: Adding the same value multiple times should change the state of the sketch only once when a…

If you are interested in new cardinality estimation algorithms for HyperLogLog sketches you could also have a look on the paper I am currently working on: http://oertl.github.io/hy…