%0 Conference Paper
%B IEEE 24th International Conference on Data Engineering, 2008. ICDE 2008
%D 2008
%T Flow Algorithms for Parallel Query Optimization
%A Deshpande, Amol
%A Hellerstein,L.
%K Casting
%K computational complexity
%K Cost function
%K Databases
%K Delay
%K distributed environment
%K Educational institutions
%K flow maximization algorithm
%K Interleaved codes
%K interoperator parallelism
%K minimisation
%K multiway join query response time minimization problem
%K parallel database
%K Parallel databases
%K parallel query optimization
%K Partitioning algorithms
%K pipeline processing
%K pipelined parallelism
%K polynomial-time algorithm
%K query planning problem
%K Query processing
%K Web service
%K Web services
%X 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.
%B IEEE 24th International Conference on Data Engineering, 2008. ICDE 2008
%I IEEE
%P 754 - 763
%8 2008/04/07/12
%@ 978-1-4244-1836-7
%G eng
%R 10.1109/ICDE.2008.4497484