io.epiphanous.flinkrunner.algorithm.cardinality
registers
Incorporates an item into the registers, updates the cardinality estimate and returns it.
Incorporates an item into the registers, updates the cardinality estimate and returns it.
the item to add
Long
correction constant alpha(m) * m**2
correction constant alpha(m) * m**2
current cardinality estimate
murmur3 128 guava hashing function generator
upper bound of intermediate range
True if no data has been added to the registers
number of registers m = 2**b
number of registers m = 2**b
Merge another HyperLogLog[T] instance into this instance.
Merge another HyperLogLog[T] instance into this instance. Note the other instance must have the same b parameter as this instance.
the other HyperLogLog[T] instance
True if data has been added to the registers
relativeError of cardinality estimates
upper bound of small range
Implements hyperloglog cardinality estimate based on paper by P. Flajolet, È. Fusy, O. Gandouet, F. Meiunier. HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm. Proceedings of Discrete Mathematics and Theoretical Computer Science. Pages 127-146. 2007.