Flow algorithms for two pipelined filter ordering problems

Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu

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

    Abstract

    Pipelined filter ordering is a central problem in database query optimization, and has received renewed attention recently in the context of environments such as the web, continuous high-speed data streams and sensor networks. We present algorithms for two natural extensions of the classical pipelined filter ordering problem: (1) a distributional type problem where the filters run in parallel and the goal is to maximize throughput, and (2) an adversarial type problem where the goal is to minimize the expected value of multiplicative regret. We show that both problems can be solved using similar flow algorithms, which find an optimal ordering scheme in time O(n2), where n is the number of filters. Our algorithm for (1) improves on an earlier O(n3 log n) algorithm of Kodialam.

    Original languageEnglish (US)
    Title of host publicationProceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006
    Pages193-202
    Number of pages10
    DOIs
    StatePublished - 2006
    Event25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006 - Chicago, IL, United States
    Duration: Jun 26 2006Jun 28 2006

    Other

    Other25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006
    CountryUnited States
    CityChicago, IL
    Period6/26/066/28/06

    Fingerprint

    Sensor networks
    Throughput

    Keywords

    • Flow algorithms
    • Pipelined filter ordering
    • Query optimization
    • Selection ordering

    ASJC Scopus subject areas

    • Software

    Cite this

    Condon, A., Deshpande, A., Hellerstein, L., & Wu, N. (2006). Flow algorithms for two pipelined filter ordering problems. In Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006 (pp. 193-202) https://doi.org/10.1145/1142351.1142379

    Flow algorithms for two pipelined filter ordering problems. / Condon, Anne; Deshpande, Amol; Hellerstein, Lisa; Wu, Ning.

    Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006. 2006. p. 193-202.

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

    Condon, A, Deshpande, A, Hellerstein, L & Wu, N 2006, Flow algorithms for two pipelined filter ordering problems. in Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006. pp. 193-202, 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006, Chicago, IL, United States, 6/26/06. https://doi.org/10.1145/1142351.1142379
    Condon A, Deshpande A, Hellerstein L, Wu N. Flow algorithms for two pipelined filter ordering problems. In Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006. 2006. p. 193-202 https://doi.org/10.1145/1142351.1142379
    Condon, Anne ; Deshpande, Amol ; Hellerstein, Lisa ; Wu, Ning. / Flow algorithms for two pipelined filter ordering problems. Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006. 2006. pp. 193-202
    @inproceedings{779876034ade49bd8a421c3132a81d54,
    title = "Flow algorithms for two pipelined filter ordering problems",
    abstract = "Pipelined filter ordering is a central problem in database query optimization, and has received renewed attention recently in the context of environments such as the web, continuous high-speed data streams and sensor networks. We present algorithms for two natural extensions of the classical pipelined filter ordering problem: (1) a distributional type problem where the filters run in parallel and the goal is to maximize throughput, and (2) an adversarial type problem where the goal is to minimize the expected value of multiplicative regret. We show that both problems can be solved using similar flow algorithms, which find an optimal ordering scheme in time O(n2), where n is the number of filters. Our algorithm for (1) improves on an earlier O(n3 log n) algorithm of Kodialam.",
    keywords = "Flow algorithms, Pipelined filter ordering, Query optimization, Selection ordering",
    author = "Anne Condon and Amol Deshpande and Lisa Hellerstein and Ning Wu",
    year = "2006",
    doi = "10.1145/1142351.1142379",
    language = "English (US)",
    isbn = "1595933182",
    pages = "193--202",
    booktitle = "Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006",

    }

    TY - GEN

    T1 - Flow algorithms for two pipelined filter ordering problems

    AU - Condon, Anne

    AU - Deshpande, Amol

    AU - Hellerstein, Lisa

    AU - Wu, Ning

    PY - 2006

    Y1 - 2006

    N2 - Pipelined filter ordering is a central problem in database query optimization, and has received renewed attention recently in the context of environments such as the web, continuous high-speed data streams and sensor networks. We present algorithms for two natural extensions of the classical pipelined filter ordering problem: (1) a distributional type problem where the filters run in parallel and the goal is to maximize throughput, and (2) an adversarial type problem where the goal is to minimize the expected value of multiplicative regret. We show that both problems can be solved using similar flow algorithms, which find an optimal ordering scheme in time O(n2), where n is the number of filters. Our algorithm for (1) improves on an earlier O(n3 log n) algorithm of Kodialam.

    AB - Pipelined filter ordering is a central problem in database query optimization, and has received renewed attention recently in the context of environments such as the web, continuous high-speed data streams and sensor networks. We present algorithms for two natural extensions of the classical pipelined filter ordering problem: (1) a distributional type problem where the filters run in parallel and the goal is to maximize throughput, and (2) an adversarial type problem where the goal is to minimize the expected value of multiplicative regret. We show that both problems can be solved using similar flow algorithms, which find an optimal ordering scheme in time O(n2), where n is the number of filters. Our algorithm for (1) improves on an earlier O(n3 log n) algorithm of Kodialam.

    KW - Flow algorithms

    KW - Pipelined filter ordering

    KW - Query optimization

    KW - Selection ordering

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

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

    U2 - 10.1145/1142351.1142379

    DO - 10.1145/1142351.1142379

    M3 - Conference contribution

    AN - SCOPUS:34250677320

    SN - 1595933182

    SN - 9781595933188

    SP - 193

    EP - 202

    BT - Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006

    ER -