K. Stocker, R. Braumandl, A. Kemper, D. Kossmann, "Integrating Semi-Join-Reducers into State-of-the-Art Query Processors", Int. Conf. on Data Engineering (ICDE), 2001. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
On Finding a Memory Lower Bound for Query Evaluation in .. - Anciaux, Bouganim.. (2003) (Correct)
....J RU for the whole query evaluation (reducing the dataflow accordingly) at the expense of computing this semi join. Note that semi join based optimizations have been extensively exploited in distributed databases to a similar purpose, namely reducing the dataflow to be sent on the network [SBK01]. Pushing down GroupBy and Sort: Property P2 gives the opportunity to push GroupBy and Sort operators down to the QEP, as long as their position remains compatible with the evaluation of their respective grouping and sorting condition. The tree presented in figure 3(b) illustrates this principle ....
K. Stocker, R. Braumandl, A. Kemper, D. Kossmann, "Integrating Semi-Join-Reducers into State-of-the-Art Query Processors", Int. Conf. on Data Engineering (ICDE), 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC