@inproceedings{449ca305ec2e48c0a0885c0144af40c7,
title = "Pipelining in query execution",
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 = "IR-19206, METIS-119729, DB-PDB: PARALLEL DATABASES, EWI-10969",
author = "A.N. Wilschut and Apers, {Peter M.G.}",
year = "1990",
month = mar,
doi = "10.1109/PARBSE.1990.77227",
language = "Undefined",
isbn = "0-8186-2035-8",
publisher = "IEEE",
pages = "562--562",
booktitle = "Proceedings of the International Conference on Databases, Parallel Architectures and Their Applications (PARBASE 1990)",
address = "United States",
note = "International Conference on Databases, Parallel Architectures and Their Applications, PARBASE 1990 ; Conference date: 07-03-1990 Through 09-03-1990",
}