HybMig

A hybrid approach to dynamic plan migration for continuous queries

Yin Yang, Jürgen Krämer, Dimitris Papadias, Bernhard Seeger

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)398-411
Number of pages14
JournalIEEE Transactions on Knowledge and Data Engineering
Volume19
Issue number3
DOIs
Publication statusPublished - Mar 2007
Externally publishedYes

Fingerprint

Program processors
Statistics
Data storage equipment

Keywords

  • Query processing

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

HybMig : A hybrid approach to dynamic plan migration for continuous queries. / Yang, Yin; Krämer, Jürgen; Papadias, Dimitris; Seeger, Bernhard.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 19, No. 3, 03.2007, p. 398-411.

Research output: Contribution to journalArticle

Yang, Yin ; Krämer, Jürgen ; Papadias, Dimitris ; Seeger, Bernhard. / HybMig : A hybrid approach to dynamic plan migration for continuous queries. In: IEEE Transactions on Knowledge and Data Engineering. 2007 ; Vol. 19, No. 3. pp. 398-411.
@article{4d0f38e4b21e4884a2f962987b57674f,
title = "HybMig: A hybrid approach to dynamic plan migration for continuous queries",
abstract = "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.",
keywords = "Query processing",
author = "Yin Yang and J{\"u}rgen Kr{\"a}mer and Dimitris Papadias and Bernhard Seeger",
year = "2007",
month = "3",
doi = "10.1109/TKDE.2007.43",
language = "English",
volume = "19",
pages = "398--411",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "3",

}

TY - JOUR

T1 - HybMig

T2 - A hybrid approach to dynamic plan migration for continuous queries

AU - Yang, Yin

AU - Krämer, Jürgen

AU - Papadias, Dimitris

AU - Seeger, Bernhard

PY - 2007/3

Y1 - 2007/3

N2 - 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.

AB - 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.

KW - Query processing

UR - http://www.scopus.com/inward/record.url?scp=33847745457&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33847745457&partnerID=8YFLogxK

U2 - 10.1109/TKDE.2007.43

DO - 10.1109/TKDE.2007.43

M3 - Article

VL - 19

SP - 398

EP - 411

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 3

ER -