HyperLogLog algorithm ( 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 (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 == Reference == http://algo.inria.fr/flajolet/Publications/FlFuGaMe07.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

(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

Reference

http://algo.inria.fr/flajolet/Publications/FlFuGaMe07.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=HyperLogLog_algorithm_(_Cardinality_Estimation)&oldid=45367"