Flow algorithms for two pipelined filter ordering problems

Anne Condon; Amol Deshpande; Lisa Hellerstein; Ning Wu

doi:10.1145/1142351.1142379

Flow algorithms for two pipelined filter ordering problems

Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu

Research output: Chapter in Book/Report/Conference proceeding › Conference 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(n²), where n is the number of filters. Our algorithm for (1) improves on an earlier O(n³ log n) algorithm of Kodialam.

Original language	English (US)
Title of host publication	Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006
Pages	193-202
Number of pages	10
DOIs	https://doi.org/10.1145/1142351.1142379
State	Published - 2006
Event	25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006 - Chicago, IL, United States Duration: Jun 26 2006 → Jun 28 2006

Publication series

Name	Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Other

Other	25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006
Country	United States
City	Chicago, IL
Period	6/26/06 → 6/28/06

Keywords

Flow algorithms
Pipelined filter ordering
Query optimization
Selection ordering

ASJC Scopus subject areas

Software
Information Systems
Hardware and Architecture

Access to Document

10.1145/1142351.1142379

Fingerprint Dive into the research topics of 'Flow algorithms for two pipelined filter ordering problems'. Together they form a unique fingerprint.

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). (Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems). 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 (Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems).

Research output: Chapter in Book/Report/Conference proceeding › Conference 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. Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 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

@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",

series = "Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems",

pages = "193--202",

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

note = "25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006 ; Conference date: 26-06-2006 Through 28-06-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

T3 - Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

SP - 193

EP - 202

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

T2 - 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006

Y2 - 26 June 2006 through 28 June 2006

ER -