论文信息 - Pipelining in query execution

Pipelining in query execution

It is shown that the use of an adjusted algorithm can improve the performance of a nested query execution containing join operations. Apart from the equijoin, the union, Cartesian product, Theta -join, and intersection operations can be implemented in a pipelining way. The difference, however, cannot be implemented in this way. The proposed algorithms are implemented in PRISMA/DB.<<ETX>>

Peter M. G. Apers | A. N. Wilschut | P. Apers

[1] William Alexander,et al. Process and dataflow control in distributed data-intensive systems , 1988, SIGMOD '88.

[2] David J. DeWitt,et al. A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment , 1989, SIGMOD '89.

[3] Paul W. P. J. Grefen,et al. Implementing PRISMA/DB in an OOPL , 1989, IWDM.