Pipelining in query execution
- 1 March 1990
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
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, Θ-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/DKeywords
This publication has 3 references indexed in Scilit:
- Implementing PRISMA/DB in an OOPLPublished by Springer Nature ,1989
- A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environmentPublished by Association for Computing Machinery (ACM) ,1989
- Process and dataflow control in distributed data-intensive systemsPublished by Association for Computing Machinery (ACM) ,1988