Flow Algorithms for Parallel Query Optimization
Deshpande, A.
Hellerstein, L.
Univ. of Maryland, College Park, MD;
This paper appears in: Data Engineering, 2008. ICDE 2008. IEEE 24th International Conference on
Publication Date: 7-12 April 2008
On page(s): 754-763
Location: Cancun,
ISBN: 978-1-4244-1836-7
INSPEC Accession Number: 9963671
Digital Object Identifier: 10.1109/ICDE.2008.4497484
Current Version Published: 2008-04-25
Abstract
We address the problem of minimizing the response time of a multi-way join query using pipelined (inter-operator) parallelism, in a parallel or a distributed environment. We observe that in order to fully exploit the parallelism in the system, we must consider a new class of ";interleaving"; plans, where multiple query plans are used simultaneously to minimize the response time of a query (or to maximize the tuple-throughput of the system). We cast the query planning problem in this environment as a ";flow maximization problem";, and present polynomial-time algorithms that (statically) find the optimal set of plans to use for a given query, for a large class of multi-way join queries. Our proposed algorithms also naturally extend to query optimization over web services. Finally we present an extensive experimental evaluation that demonstrates both the need to consider such plans in parallel query processing and the effectiveness of our algorithms.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
