G. Cormode and S. Muthukrishnan. Approximating data with the count-min data structure. IEEE Software, 2012.

Sketch data structures have been introduced to compactly summarize massive data sets and allow key properties of the data to be approximated accurately. In this paper, we introduce a prominent example, the Count-Min sketch, and describe how it accurately solves a fundamental problem of tracking counts of items in large data sets. Applications, implementations and extensions are also discussed.

bib | .pdf ] Back

This file was generated by bibtex2html 1.92.