Optimization Strategy of Bidirectional Join Enumeration in Multi-Core CPUS
Most contemporary database systems query optimizers exploit System-Rs 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.
Multi-core Query optimization Join enumeration dynamic programming
Yongheng Chen Wanli Zuo Fenglin He
Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology, Jilin University, Changchun, 130012, China
国际会议
重庆
英文
383-387
2010-12-11（万方平台首次上网日期，不代表论文的发表时间）