Rangesum histograms

Shanmugavelayutham Muthukrishnan, Martin Strauss

    Research output: Contribution to conferencePaper

    Abstract

    Histograms are piecewise-constant approximations of signals. The goal in constructing appropriate histograms is to optimize them for specific applications. This paper presents the first general algorithms for approximating histograms for rangesum queries. A variety of results are given, with varying quality of approximation, suitable for different models.

    Original languageEnglish (US)
    Pages233-242
    Number of pages10
    StatePublished - Jan 1 2003
    EventConfiguralble Computing: Technology and Applications - Boston, MA, United States
    Duration: Nov 2 1998Nov 3 1998

    Other

    OtherConfiguralble Computing: Technology and Applications
    CountryUnited States
    CityBoston, MA
    Period11/2/9811/3/98

    Fingerprint

    Histogram
    Approximation
    Optimise
    Query
    Model

    ASJC Scopus subject areas

    • Software
    • Mathematics(all)

    Cite this

    Muthukrishnan, S., & Strauss, M. (2003). Rangesum histograms. 233-242. Paper presented at Configuralble Computing: Technology and Applications, Boston, MA, United States.

    Rangesum histograms. / Muthukrishnan, Shanmugavelayutham; Strauss, Martin.

    2003. 233-242 Paper presented at Configuralble Computing: Technology and Applications, Boston, MA, United States.

    Research output: Contribution to conferencePaper

    Muthukrishnan, S & Strauss, M 2003, 'Rangesum histograms', Paper presented at Configuralble Computing: Technology and Applications, Boston, MA, United States, 11/2/98 - 11/3/98 pp. 233-242.
    Muthukrishnan S, Strauss M. Rangesum histograms. 2003. Paper presented at Configuralble Computing: Technology and Applications, Boston, MA, United States.
    Muthukrishnan, Shanmugavelayutham ; Strauss, Martin. / Rangesum histograms. Paper presented at Configuralble Computing: Technology and Applications, Boston, MA, United States.10 p.
    @conference{d4c8fcb04b984c1d95335f207e0550c1,
    title = "Rangesum histograms",
    abstract = "Histograms are piecewise-constant approximations of signals. The goal in constructing appropriate histograms is to optimize them for specific applications. This paper presents the first general algorithms for approximating histograms for rangesum queries. A variety of results are given, with varying quality of approximation, suitable for different models.",
    author = "Shanmugavelayutham Muthukrishnan and Martin Strauss",
    year = "2003",
    month = "1",
    day = "1",
    language = "English (US)",
    pages = "233--242",
    note = "Configuralble Computing: Technology and Applications ; Conference date: 02-11-1998 Through 03-11-1998",

    }

    TY - CONF

    T1 - Rangesum histograms

    AU - Muthukrishnan, Shanmugavelayutham

    AU - Strauss, Martin

    PY - 2003/1/1

    Y1 - 2003/1/1

    N2 - Histograms are piecewise-constant approximations of signals. The goal in constructing appropriate histograms is to optimize them for specific applications. This paper presents the first general algorithms for approximating histograms for rangesum queries. A variety of results are given, with varying quality of approximation, suitable for different models.

    AB - Histograms are piecewise-constant approximations of signals. The goal in constructing appropriate histograms is to optimize them for specific applications. This paper presents the first general algorithms for approximating histograms for rangesum queries. A variety of results are given, with varying quality of approximation, suitable for different models.

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

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

    M3 - Paper

    AN - SCOPUS:0038077572

    SP - 233

    EP - 242

    ER -