Data streams: Algorithms and applications

Shanmugavelayutham Muthukrishnan

    Research output: Contribution to journalArticle

    Abstract

    In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has emerged for reasoning about algorithms that work within these constraints on space, time, and number of passes. Some of the methods rely on metric embeddings, pseudo-random computations, sparse approximation theory and communication complexity. The applications for this scenario include IP network traffic analysis, mining text message streams and processing massive data sets in general. Researchers in Theoretical Computer Science, Databases, IP Networking and Computer Systems are working on the data stream challenges. This article is an overview and survey of data stream algorithmics and is an updated version of [175].

    Original languageEnglish (US)
    Pages (from-to)117-236
    Number of pages120
    JournalFoundations and Trends in Theoretical Computer Science
    Volume1
    Issue number2
    DOIs
    StatePublished - Aug 1 2005

    Fingerprint

    Data Streams
    Approximation theory
    Metric Embeddings
    Computer science
    Sparse Approximation
    Traffic Analysis
    Scenarios
    Computer systems
    IP Networks
    Communication Complexity
    Text Mining
    Approximation Theory
    Network Analysis
    Network Traffic
    Data storage equipment
    Networking
    Communication
    Computer Science
    Reasoning

    ASJC Scopus subject areas

    • Theoretical Computer Science

    Cite this

    Data streams : Algorithms and applications. / Muthukrishnan, Shanmugavelayutham.

    In: Foundations and Trends in Theoretical Computer Science, Vol. 1, No. 2, 01.08.2005, p. 117-236.

    Research output: Contribution to journalArticle

    Muthukrishnan, Shanmugavelayutham. / Data streams : Algorithms and applications. In: Foundations and Trends in Theoretical Computer Science. 2005 ; Vol. 1, No. 2. pp. 117-236.
    @article{341f250a59ad44468466fd9f507f5d7d,
    title = "Data streams: Algorithms and applications",
    abstract = "In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has emerged for reasoning about algorithms that work within these constraints on space, time, and number of passes. Some of the methods rely on metric embeddings, pseudo-random computations, sparse approximation theory and communication complexity. The applications for this scenario include IP network traffic analysis, mining text message streams and processing massive data sets in general. Researchers in Theoretical Computer Science, Databases, IP Networking and Computer Systems are working on the data stream challenges. This article is an overview and survey of data stream algorithmics and is an updated version of [175].",
    author = "Shanmugavelayutham Muthukrishnan",
    year = "2005",
    month = "8",
    day = "1",
    doi = "10.1561/0400000002",
    language = "English (US)",
    volume = "1",
    pages = "117--236",
    journal = "Foundations and Trends in Theoretical Computer Science",
    issn = "1551-305X",
    publisher = "Now Publishers Inc",
    number = "2",

    }

    TY - JOUR

    T1 - Data streams

    T2 - Algorithms and applications

    AU - Muthukrishnan, Shanmugavelayutham

    PY - 2005/8/1

    Y1 - 2005/8/1

    N2 - In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has emerged for reasoning about algorithms that work within these constraints on space, time, and number of passes. Some of the methods rely on metric embeddings, pseudo-random computations, sparse approximation theory and communication complexity. The applications for this scenario include IP network traffic analysis, mining text message streams and processing massive data sets in general. Researchers in Theoretical Computer Science, Databases, IP Networking and Computer Systems are working on the data stream challenges. This article is an overview and survey of data stream algorithmics and is an updated version of [175].

    AB - In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has emerged for reasoning about algorithms that work within these constraints on space, time, and number of passes. Some of the methods rely on metric embeddings, pseudo-random computations, sparse approximation theory and communication complexity. The applications for this scenario include IP network traffic analysis, mining text message streams and processing massive data sets in general. Researchers in Theoretical Computer Science, Databases, IP Networking and Computer Systems are working on the data stream challenges. This article is an overview and survey of data stream algorithmics and is an updated version of [175].

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

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

    U2 - 10.1561/0400000002

    DO - 10.1561/0400000002

    M3 - Article

    VL - 1

    SP - 117

    EP - 236

    JO - Foundations and Trends in Theoretical Computer Science

    JF - Foundations and Trends in Theoretical Computer Science

    SN - 1551-305X

    IS - 2

    ER -