Pipelining in query execution

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, Theta -join, and intersection operations can be implemented in a pipelining way. The difference, however, canno...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:PARBASE-90, International Conference on Databases, Parallel Architectures, and Their Applications : March 7-9, 1990, Miami Beach, Florida s. 562
Hlavní autori: Wilschut, A.N., Apers, P.M.G.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE Comput. Soc. Press 1990
Predmet:
Algorithm design and analysis
Costs
Delay
Electrical capacitance tomography
Performance gain
Pipeline processing
Relational databases
ISBN:0818620358, 9780818620355
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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, Theta -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.< >
ISBN:0818620358
9780818620355
DOI:10.1109/PARBSE.1990.77227