Optimal histograms for hierarchical range queries

Nick Koudas, Shanmugavelayutham Muthukrishnan, Divesh Srivastava

    Research output: Contribution to conferencePaper

    Abstract

    Optimal histograms are computed for hierarchical range queries. It is shown that optimal histograms for equality queries are sub-optimal for hierarchical range queries. Polynomial time, dynamic programming algorithms are presented for computing optimal histograms that would provably minimize expected error for a given amount of space. The algorithm for the case of one-sided ranges is proved to be as efficient in running time as the V-optimal algorithm, which computes optimal histograms for equality series.

    Original languageEnglish (US)
    Pages196-204
    Number of pages9
    StatePublished - Dec 3 2000
    EventPODS 2000 - 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems - Dallas, TX, USA
    Duration: May 15 2000May 17 2000

    Conference

    ConferencePODS 2000 - 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems
    CityDallas, TX, USA
    Period5/15/005/17/00

    Fingerprint

    Dynamic programming
    Polynomials

    ASJC Scopus subject areas

    • Software
    • Information Systems
    • Hardware and Architecture

    Cite this

    Koudas, N., Muthukrishnan, S., & Srivastava, D. (2000). Optimal histograms for hierarchical range queries. 196-204. Paper presented at PODS 2000 - 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Dallas, TX, USA, .

    Optimal histograms for hierarchical range queries. / Koudas, Nick; Muthukrishnan, Shanmugavelayutham; Srivastava, Divesh.

    2000. 196-204 Paper presented at PODS 2000 - 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Dallas, TX, USA, .

    Research output: Contribution to conferencePaper

    Koudas, N, Muthukrishnan, S & Srivastava, D 2000, 'Optimal histograms for hierarchical range queries' Paper presented at PODS 2000 - 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Dallas, TX, USA, 5/15/00 - 5/17/00, pp. 196-204.
    Koudas N, Muthukrishnan S, Srivastava D. Optimal histograms for hierarchical range queries. 2000. Paper presented at PODS 2000 - 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Dallas, TX, USA, .
    Koudas, Nick ; Muthukrishnan, Shanmugavelayutham ; Srivastava, Divesh. / Optimal histograms for hierarchical range queries. Paper presented at PODS 2000 - 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Dallas, TX, USA, .9 p.
    @conference{07f1cf0d3c614d8085f057ca479941aa,
    title = "Optimal histograms for hierarchical range queries",
    abstract = "Optimal histograms are computed for hierarchical range queries. It is shown that optimal histograms for equality queries are sub-optimal for hierarchical range queries. Polynomial time, dynamic programming algorithms are presented for computing optimal histograms that would provably minimize expected error for a given amount of space. The algorithm for the case of one-sided ranges is proved to be as efficient in running time as the V-optimal algorithm, which computes optimal histograms for equality series.",
    author = "Nick Koudas and Shanmugavelayutham Muthukrishnan and Divesh Srivastava",
    year = "2000",
    month = "12",
    day = "3",
    language = "English (US)",
    pages = "196--204",
    note = "PODS 2000 - 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems ; Conference date: 15-05-2000 Through 17-05-2000",

    }

    TY - CONF

    T1 - Optimal histograms for hierarchical range queries

    AU - Koudas, Nick

    AU - Muthukrishnan, Shanmugavelayutham

    AU - Srivastava, Divesh

    PY - 2000/12/3

    Y1 - 2000/12/3

    N2 - Optimal histograms are computed for hierarchical range queries. It is shown that optimal histograms for equality queries are sub-optimal for hierarchical range queries. Polynomial time, dynamic programming algorithms are presented for computing optimal histograms that would provably minimize expected error for a given amount of space. The algorithm for the case of one-sided ranges is proved to be as efficient in running time as the V-optimal algorithm, which computes optimal histograms for equality series.

    AB - Optimal histograms are computed for hierarchical range queries. It is shown that optimal histograms for equality queries are sub-optimal for hierarchical range queries. Polynomial time, dynamic programming algorithms are presented for computing optimal histograms that would provably minimize expected error for a given amount of space. The algorithm for the case of one-sided ranges is proved to be as efficient in running time as the V-optimal algorithm, which computes optimal histograms for equality series.

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

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

    M3 - Paper

    SP - 196

    EP - 204

    ER -