Academic
Publications
Adaptive join processing in pipelined plans

Adaptive join processing in pipelined plans,10.1145/1739041.1739066,Kwanchai Eurviriyanukul,Norman W. Paton,Alvaro A. A. Fernandes,Steven J. Lynden

Adaptive join processing in pipelined plans   (Citations: 2)
BibTex | RIS | RefWorks Download
In adaptive query processing, the way in which a query is evaluated is changed in the light of feedback obtained from the environment during query evaluation. Such feedback may, for example, establish that misleading selectivity estimates were used when the query was compiled, leading to the optimizer choosing an inappropriate join order or unsuitable join algorithms. This paper describes how joins can be reordered, and the join algorithms used replaced, while they are being evaluated in pipelined plans. Where joins are reordered and/or replaced during their evaluation, the approach avoids duplicating work that has already been carried out, by resuming from where the previous plan left off. The approach has been evaluated empirically, and shown to be effective for improving query performance in the light of misleading selectivity estimates.
Conference: Extending Database Technology - EDBT , pp. 183-194, 2010
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...[12,13]). Such fine grained techniques must be able to characterize precisely how the partial result of an operator relates to the data consumed, and thus what work remains to be done [13]...
    • ...[12,13]). Such fine grained techniques must be able to characterize precisely how the partial result of an operator relates to the data consumed, and thus what work remains to be done [13]...

    Daniele Bragaet al. Run-Time Adaptivity for Search Computing

Sort by: