HyperLogLog++ ( Cardinality Estimation)
Jump to navigation
Jump to search
Time Complexity
$O(N)$
Space Complexity
$O(eps^{-2}*log(log(n)$))+log(n)) words
((see hyperloglog?))
Description
Approximate?
Approximate
Approximation Factor:
Randomized?
Yes,
Model of Computation
Word RAM
Year
2014
Reference
https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/40671.pdf