Pipelining in Query Executions

Wilschut, Annita N. and Apers, Peter M.G. (1990) Pipelining in Query Executions. In: International Conference on Databases, Parallel Architectures and their applications, PARBASE, 1990, Miami Beach, Florida, USA.

Preview

PDF
87Kb

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
Item Type:	Conference or Workshop Item
Copyright:	©1990 IEEE
Research Group:	Information Systems (IS)
Link to this item:	http://purl.utwente.nl/publications/19206
Official URL:	http://dx.doi.org/10.1109/PARBSE.1990.77227
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 119729