Issue No. 03 - March (2007 vol. 19)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2007.43
J? Kr?mer , IEEE Computer Society
Bernhard Seeger , IEEE Computer Society
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.
Y. Yang, J. Kr?mer, D. Papadias and B. Seeger, "HybMig: A Hybrid Approach to Dynamic Plan Migration for Continuous Queries," in IEEE Transactions on Knowledge & Data Engineering, vol. 19, no. , pp. 398-411, 2007.