Cost-based query scrambling for initial delays
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Ripple joins for online aggregation
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 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
Aurora: a new model and architecture for data stream management
The VLDB Journal — The International Journal on Very Large Data Bases
Dynamic plan migration for continuous queries over data streams
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
PIPES: a public infrastructure for processing and exploring streams
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Operator scheduling in data stream systems
The VLDB Journal — The International Journal on Very Large Data Bases
Adaptive Caching for Continuous Queries
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
The CQL continuous query language: semantic foundations and query execution
The VLDB Journal — The International Journal on Very Large Data Bases
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
Linear road: a stream data management benchmark
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Query languages and data models for database sequences and data streams
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Lifting the burden of history from adaptive query processing
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
The case for precision sharing
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Biologically-inspired distributed middleware management for stream processing systems
Proceedings of the 9th ACM/IFIP/USENIX International Conference on Middleware
Semantics and implementation of continuous sliding window queries over data streams
ACM Transactions on Database Systems (TODS)
NexusDS: a flexible and extensible middleware for distributed stream processing
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
A new look at generating multi-join continuous query plans: A qualified plan generation problem
Data & Knowledge Engineering
Changing flights in mid-air: a model for safely modifying continuous queries
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
RoSeS: a continuous content-based query engine for RSS feeds
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Distributed Adaptive Windowed Stream Join Processing
International Journal of Distributed Systems and Technologies
Resa: realtime elastic streaming analytics in the cloud
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Hi-index | 0.00 |
In data stream environments, the initial plan of a long-running query may gradually become inefficient due to changes of the data characteristics. In this case, the query optimizer will generate a more efficient plan based on the current statistics. The online transition from the old to the new plan is called dynamic plan migration. In addition to correctness, an effective technique for dynamic plan migration should achieve the following objectives: 1) minimize the memory and CPU overhead of the migration, 2) reduce the duration of the transition, and 3) maintain a steady output rate. The only known solutions for this problem are the moving states (MS) and parallel track (PT) strategies, which have some serious shortcomings related to the above objectives. Motivated by these shortcomings, we first propose HybMig, which combines the merits of MS and PT and outperforms both in every aspect. As a second step, we extend PT, MS, and HybMig to the general problem of migration, where both the new and the old plans are treated as black boxes.