HyperLogLog algorithm ( Cardinality Estimation)
Jump to navigation
Jump to search
Time Complexity
$O(N)$
Space Complexity
$O(eps^{-2}*log(log(n)$))+log(n)) words
(https://oertl.github.io/hyperloglog-sketch-estimation-paper/paper/paper.pdf)
Description
Approximate?
Approximate
Approximation Factor:
Randomized?
Yes,
Model of Computation
Word RAM
Year
2007