On the optimal nesting order for computing N-relational joins
ACM Transactions on Database Systems (TODS)
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Multi-table joins through bitmapped join indices
ACM SIGMOD Record
Join queries with external text sources: execution and optimization techniques
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
On chromatic sums and distributed resource allocation
Information and Computation
Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
WSQ/DSQ: a practical approach for combined querying of databases and the Web
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Efficient execution of joins in a star schema
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Optimization of Nonrecursive Queries
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Efficient information gathering on the Internet
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Adaptive ordering of pipelined stream filters
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Approximating Min Sum Set Cover
Algorithmica
Exploiting Correlated Attributes in Acquisitional Query Processing
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Flow algorithms for two pipelined filter ordering problems
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query optimization over web services
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
A simple local-control approximation algorithm for multicommodity flow
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
The pipelined set cover problem
ICDT'05 Proceedings of the 10th international conference on Database Theory
Decentralized execution of linear workflows over web services
Future Generation Computer Systems
Max-throughput for (conservative) k-of-n testing
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Parallel pipelined filter ordering with precedence constraints
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
Pipelined filter ordering is a central problem in database query optimization. The problem is to determine the optimal order in which to apply a given set of commutative filters (predicates) to a set of elements (the tuples of a relation), so as to find, as efficiently as possible, the tuples that satisfy all of the filters. Optimization of pipelined filter ordering has recently received renewed attention in the context of environments such as the Web, continuous high-speed data streams, and sensor networks. Pipelined filter ordering problems are also studied in areas such as fault detection and machine learning under names such as learning with attribute costs, minimum-sum set cover, and satisficing search. 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 present two related algorithms for solving (1), both running in time O(n2), which improve on the O(n3 log n) algorithm of Kodialam. We use techniques from our algorithms for (1) to obtain an algorithm for (2).