Frugal streaming for estimating quantiles

Qiang Ma, S. Muthukrishnan, Mark Sandler

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Modern applications require processing streams of data for estimating statistical quantities such as quantiles with small amount of memory. In many such applications, in fact, one needs to compute such statistical quantities for each of a large number of groups (e.g.,network traffic grouped by source IP address), which additionally restricts the amount of memory available for the stream for any particular group. We address this challenge and introduce frugal streaming, that is algorithms that work with tiny - typically, sub-streaming - amount of memory per group. We design a frugal algorithm that uses only one unit of memory per group to compute a quantile for each group. For stochastic streams where data items are drawn from a distribution independently, we analyze and show that the algorithm finds an approximation to the quantile rapidly and remains stably close to it. We also propose an extension of this algorithm that uses two units of memory per group. We show experiments with real world data from HTTP trace and Twitter that our frugal algorithms are comparable to existing streaming algorithms for estimating any quantile, but these existing algorithms use far more space per group and are unrealistic in frugal applications; further, the two memory frugal algorithm converges significantly faster than the one memory algorithm.

    Original languageEnglish (US)
    Title of host publicationSpace-Efficient Data Structures, Streams, and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday
    PublisherSpringer Verlag
    Pages77-96
    Number of pages20
    ISBN (Print)9783642402722
    DOIs
    StatePublished - 2013
    EventConference on Space-Efficient Data Structures, Streams, and Algorithms - Waterloo, ON, Canada
    Duration: Aug 15 2013Aug 16 2013

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume8066 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    OtherConference on Space-Efficient Data Structures, Streams, and Algorithms
    CountryCanada
    CityWaterloo, ON
    Period8/15/138/16/13

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'Frugal streaming for estimating quantiles'. Together they form a unique fingerprint.

    Cite this