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

Graham Cormode, Shanmugavelayutham Muthukrishnan

    Research output: Contribution to journalArticle

    Abstract

    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)
    Volume2976
    StatePublished - Dec 1 2004

    Fingerprint

    Data Streams
    Data structures
    Count
    Query
    Summarization
    Quantile
    Scalar, inner or dot product
    Data Structures
    Range of data

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    An improved data stream summary : The Count-Min Sketch and its applications. / Cormode, Graham; Muthukrishnan, Shanmugavelayutham.

    In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 2976, 01.12.2004, p. 29-38.

    Research output: Contribution to journalArticle

    @article{75504e4620cd441885bbfa14e8395d71,
    title = "An improved data stream summary: The Count-Min Sketch and its applications",
    abstract = "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.",
    author = "Graham Cormode and Shanmugavelayutham Muthukrishnan",
    year = "2004",
    month = "12",
    day = "1",
    language = "English (US)",
    volume = "2976",
    pages = "29--38",
    journal = "Lecture Notes in Computer Science",
    issn = "0302-9743",
    publisher = "Springer Verlag",

    }

    TY - JOUR

    T1 - An improved data stream summary

    T2 - The Count-Min Sketch and its applications

    AU - Cormode, Graham

    AU - Muthukrishnan, Shanmugavelayutham

    PY - 2004/12/1

    Y1 - 2004/12/1

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=35048819960&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=35048819960&partnerID=8YFLogxK

    M3 - Article

    VL - 2976

    SP - 29

    EP - 38

    JO - Lecture Notes in Computer Science

    JF - Lecture Notes in Computer Science

    SN - 0302-9743

    ER -