Pipelining in query execution

A.N. Wilschut, Peter M.G. Apers

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

30 Citations (Scopus)
65 Downloads (Pure)

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
Original languageUndefined
Title of host publicationProceedings of the International Conference on Databases, Parallel Architectures and Their Applications (PARBASE 1990)
Place of PublicationLos Alamitos
PublisherIEEE Computer Society
Pages562-562
Number of pages1
ISBN (Print)0-8186-2035-8
DOIs
Publication statusPublished - Mar 1990

Publication series

Name
PublisherIEEE

Keywords

  • IR-19206
  • METIS-119729
  • DB-PDB: PARALLEL DATABASES
  • EWI-10969

Cite this

Wilschut, A. N., & Apers, P. M. G. (1990). Pipelining in query execution. In Proceedings of the International Conference on Databases, Parallel Architectures and Their Applications (PARBASE 1990) (pp. 562-562). Los Alamitos: IEEE Computer Society. https://doi.org/10.1109/PARBSE.1990.77227