HyperLogLog++ ( Cardinality Estimation)

From Algorithm Wiki

Revision as of 11: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")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=HyperLogLog%2B%2B_(_Cardinality_Estimation)&oldid=45368"