Dynamic query scheduling in data integration systems

Execution plans produced by traditional query optimizers for data integration queries may yield poor performance for several reasons. The cost estimates may be inaccurate, the memory available at run-time may be insufficient, or data delivery rate can be unpredictable. We address the problem of unpr...

Full description

Saved in:
Bibliographic Details
Published inProceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073) pp. 425 - 434
Main Authors Bouganim, L., Fabret, F., Mohan, C., Valduriez, P.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2000
Subjects
Costs
Decision support systems
Delay effects
Dynamic scheduling
Engines
Fiber reinforced plastics
Query processing
Relational databases
Runtime
Online AccessGet full text

Cover

More Information
Summary:Execution plans produced by traditional query optimizers for data integration queries may yield poor performance for several reasons. The cost estimates may be inaccurate, the memory available at run-time may be insufficient, or data delivery rate can be unpredictable. We address the problem of unpredictable data arrival rate. We propose to dynamically schedule queries in order to deal with irregular data delivery rate and gracefully adapt to the available memory. Our approach performs careful step-by-step scheduling of several query fragments and processes these fragments based on data arrivals. We describe a performance evaluation that shows important performance gains in several configurations.
ISBN:9780769505060
0769505066
ISSN:1063-6382
2375-026X
DOI:10.1109/ICDE.2000.839442