Rule condition testing and action execution in Ariel
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Predicate migration: optimizing queries with expensive predicates
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Randomized algorithms
Optimization of queries with user-defined predicates
ACM Transactions on Database Systems (TODS)
The SIFT information dissemination system
ACM Transactions on Database Systems (TODS)
Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Scheduling precedence-constrained jobs with stochastic processing times on parallel machines
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Pipelining in multi-query optimization
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximation algorithms
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Continuously adaptive continuous queries over streams
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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 the Stochastic Knapsack Problem: The Benefit of Adaptivity
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Content-based routing: different plans for different data
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Resource sharing in continuous sliding-window aggregates
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Model-driven data acquisition in sensor networks
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Foundations and Trends in Databases
Information Sciences: an International Journal
Near-optimal algorithms for shared filter evaluation in data stream systems
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A generic flow algorithm for shared filter ordering problems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Prefilter: predicate pushdown at streaming speeds
SSPS '08 Proceedings of the 2nd international workshop on Scalable stream processing system
Making filters smart in distributed data stream environments
Information Sciences: an International Journal
Selectivity-sensitive shared evaluation of multiple continuous XPath queries over XML streams
Information Sciences: an International Journal
An execution environment for C-SPARQL queries
Proceedings of the 13th International Conference on Extending Database Technology
Approximation algorithms for optimal decision trees and adaptive TSP problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Adaptive optimization for multiple continuous queries
Data & Knowledge Engineering
Large-scale continuous subgraph queries on streams
Proceedings of the first annual workshop on High performance computing meets databases
Minimum latency submodular cover
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Evaluating continuous top-k queries over document streams
World Wide Web
Hi-index | 0.00 |
We consider the problem of optimizing and executing multiple continuous queries, where each query is a conjunction of filters and each filter may occur in multiple queries. When filters are expensive, significant performance gains are achieved by sharing filter evaluations across queries. A shared execution strategy in our scenario can either be fixed, in which filters are evaluated in the same predetermined order for all input, or adaptive, in which the next filter to be evaluated is chosen at runtime based on the results of the filters evaluated so far. We show that as filter costs increase, the best adaptive strategy is superior to any fixed strategy, despite the overhead of adaptivity. We show that itis NP-hard to find the optimal adaptive strategy, even if we are willing to approximate within any factor smaller than m where m is the number of queries. We then present a greedy adaptive execution strategy and show that it approximates the best adaptive strategy to within a factor O(log2m log n) where n is the number of distinct filters. We also give a precomputation technique that can reduce the execution overhead of adaptive strategies.