Optimization Strategy of Bidirectional Join Enumeration in Multi-Core CPUS

Abstract:

Article Preview

Most contemporary database systems query optimizers exploit System-R’s Bottom-up dynamic programming method (DP) to find the optimal query execution plan (QEP) without evaluating redundant sub-plans. As modern microprocessors employ multiple cores to accelerate computations, the parallel optimization algorithm has been proposed to parallelize the Bottom-up DP query optimization process. However Top-down DP method can derive upper bounds for the costs of the plans it generates which is not available to typical Bottom-up DP method since such method generate and cost all subplans before considering larger containing plans. This paper combined the enhancements of two approaches and proposes a comprehensive and practical algorithm based graph-traversal driven, referred to here as DPbid, for parallelizing query optimization in the multi-core processor architecture. This paper has implemented such a search strategy and experimental results show that can improve optimization time effective compared to known existing algorithms.

Info:

Periodical:

Edited by:

Ran Chen

Pages:

383-387

DOI:

10.4028/www.scientific.net/AMM.44-47.383

Citation:

Y. H. Chen et al., "Optimization Strategy of Bidirectional Join Enumeration in Multi-Core CPUS", Applied Mechanics and Materials, Vols. 44-47, pp. 383-387, 2011

Online since:

December 2010

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.