Exploiting inter-operation parallelism for SQL query optimization

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we describe an approach to determine parallel scheduling for extended SQL query operations [12]. The parallelization strategy generate a parallel program which includes the pipeline and partition parallelism taking into account resource contention. Performance evaluation shows the efficiency of each type of parallelism as a function of number of processors. The main contributions of this work is the consideration of all search spaces (left-deep trees, right-deep trees and bushy trees).

Cite

CITATION STYLE

APA

Hameurlain, A., & Morvan, F. (1994). Exploiting inter-operation parallelism for SQL query optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 856 LNCS, pp. 759–768). Springer Verlag. https://doi.org/10.1007/3-540-58435-8_242

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free