Details
-
New Feature
-
Status: Open
-
Not a Priority
-
Resolution: Unresolved
-
None
-
None
Description
Count-Min sketch is a hashing-based algorithm for approximately keeping track of the frequencies of elements in a data stream. It is described by Cormode et al. in the following paper:
http://dimacs.rutgers.edu/~graham/pubs/papers/cmsoft.pdf
Note that this algorithm can be conveniently implemented in a distributed way, as described in section 3.2 of the paper.
The paper
http://www.vldb.org/conf/2002/S10P03.pdf
also describes algorithms for approximately keeping track of frequencies, but here the user can specify a threshold below which she is not interested in the frequency of an element. The error-bounds are also different than the Count-min sketch algorithm.