DocumentCode :
2888796
Title :
Pipelining in query execution
Author :
Wilschut, Annita N. ; Apers, Peter M G
Author_Institution :
Twente Univ., Enschede, Netherlands
fYear :
1990
fDate :
7-9 Mar 1990
Firstpage :
562
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/DB
Keywords :
pipeline processing; relational databases; Cartesian product; PRISMA/DB; adjusted algorithm; equijoin; intersection operations; join operations; query execution; union; Algorithm design and analysis; Costs; Delay; Electrical capacitance tomography; Performance gain; Pipeline processing; Relational databases;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Databases, Parallel Architectures and Their Applications,. PARBASE-90, International Conference on
Conference_Location :
Miami Beach, FL
Print_ISBN :
0-8186-2035-8
Type :
conf
DOI :
10.1109/PARBSE.1990.77227
Filename :
77227
Link To Document :
بازگشت