LogLog 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(log(log(n)$)) words (http://algo.inria.fr/flajolet/Publications/DuFl03-LNCS.pdf) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == Yes, == Model of Computation == Word RAM == Year == 2003 == Reference == http://algo.inria.fr/flajolet/Publications/DuFl03-LNCS.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(N)$

Space Complexity

$O(log(log(n)$)) words

(http://algo.inria.fr/flajolet/Publications/DuFl03-LNCS.pdf)

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

Yes,

Model of Computation

Word RAM

Year

2003

Reference

http://algo.inria.fr/flajolet/Publications/DuFl03-LNCS.pdf

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