Count-Min Sketch

  • Cormode G
N/ACitations
Citations of this article
46Readers
Mendeley users who have this article in their library.
Get full text

Abstract

SynonymsCM SketchDefinitionThe Count-Min (CM) Sketch is a compact summary data structure capable of representing a high-dimensional vector and answering queries on this vector, in particular point queries and dot product queries, with strong accuracy guarantees. Such queries are at the core of many computations, so the structure can be used in order to answer a variety of other queries, such as frequent items (heavy hitters), quantile finding, join size estimation, and more. Since the data structure can easily process updates in the form of additions or subtractions to dimensions of the vector (which may correspond to insertions or deletions, or other transactions), it is capable of working over streams of updates, at high rates.The data structure maintains the linear projection of the vector with a number of other random vectors. These vectors are defined implicitly by simple hash functions. Increasing the range of the hash functions increases the accuracy of the sum ...

Cite

CITATION STYLE

APA

Cormode, G. (2014). Count-Min Sketch. In Encyclopedia of Algorithms (pp. 1–6). Springer US. https://doi.org/10.1007/978-3-642-27848-8_579-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free