Pipelining in query execution

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

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

31 Citations (Scopus)
81 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
EventInternational Conference on Databases, Parallel Architectures and Their Applications, PARBASE 1990 - Miami Beach, FL, USA
Duration: 7 Mar 19909 Mar 1990

Publication series

Name
PublisherIEEE

Conference

ConferenceInternational Conference on Databases, Parallel Architectures and Their Applications, PARBASE 1990
Period7/03/909/03/90
Other7-9 March 1990

Keywords

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

Cite this