Affordable Access

Pipelining in Query Executions

Authors
Publisher
IEEE
Publication Date
Disciplines
  • Computer Science

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

There are no comments yet on this publication. Be the first to share your thoughts.