An improved data stream summary: The Count-Min Sketch and its applications

Graham Cormode, S. Muthukrishnan

    Research output: Contribution to journalArticlepeer-review


    We introduce a new sublinear space data structure - the Count-Min Sketch - for summarizing data streams. Our sketch allows fundamental queries in data stream summarization such as point, range, and inner product queries to be approximately answered very quickly; in addition, it can be applied to solve several important problems in data streams such as finding quantiles, frequent items, etc. The time and space bounds we show for using the CM sketch to solve these problems significantly improve those previously known - typically from 1/ε 2 to 1/ε in factor.

    Original languageEnglish (US)
    Pages (from-to)29-38
    Number of pages10
    JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    StatePublished - Dec 1 2004

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • General Computer Science


    Dive into the research topics of 'An improved data stream summary: The Count-Min Sketch and its applications'. Together they form a unique fingerprint.

    Cite this