Answers are grounded in this paper and cite their sources.
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 xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
No takes yet. Share an insight, caveat, or question.
Wilschut et al. (2002) studied this question.