Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rate-based query optimization for streaming information sources
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Continuously adaptive continuous queries over streams
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Optimization of Nonrecursive Queries
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Issues in data stream management
ACM SIGMOD Record
Approximate join processing over data streams
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
An initial study of overheads of eddies
ACM SIGMOD Record
Adaptive ordering of pipelined stream filters
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Static optimization of conjunctive queries with sliding windows over infinite streams
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Adaptive Caching for Continuous Queries
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Stream window join: tracking moving objects in sensor-network databases
SSDBM '03 Proceedings of the 15th International Conference on Scientific and Statistical Database Management
GrubJoin: An Adaptive, Multi-Way, Windowed Stream Join with Time Correlation-Aware CPU Load Shedding
IEEE Transactions on Knowledge and Data Engineering
Maximizing the output rate of multi-way join queries over streaming information sources
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Processing sliding window multi-joins in continuous queries over data streams
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Lifting the burden of history from adaptive query processing
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
M-COPE: a multiple continuous query processing engine
Proceedings of the 18th ACM conference on Information and knowledge management
i-SEE: integrated stream execution environment over on-line data streams
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
| Hi-index | 0.00 |
Query processing for data streams should be continuous and rapid, which requires strict time constraint. In most previous researches, in order to guarantee this constraint, the evaluation order of join predicates in a continuous query is optimized by a greedy. However, the greedy strategy traces only the first promising plan, so that it often finds a sub-optimal plan. This paper proposes an improved scheme called an Adaptively Sharing-based Extended Greedy Algorithm(A-SEGO). Given continuous queries with multiple join operations, they simultaneously trace a set of promising plans to reduce the possibility of producing a sub-optimal plan. Also it can control the time to optimize continuous queries depending the current processing load by controlling the number of traced plans. Experiment results illustrate the performance of the A-SEGO in various stream environments.