Bottom-m sketches streaming algorithm (streaming 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(m)$ words (only keep track of m minimum values. also assuming hash function requires O(1) space) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == Yes, == Model of Computation == Word RAM == Year == 1980 == Reference ==")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(N)$

Space Complexity

$O(m)$ words

(only keep track of m minimum values. also assuming hash function requires O(1) space)

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

Yes,

Model of Computation

Word RAM

Year

1980

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Bottom-m_sketches_streaming_algorithm_(streaming_Cardinality_Estimation)&oldid=45370"