HyperLogLog++ ( Cardinality Estimation)
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")
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