Journal of Jilin University Science Edition
Previous Articles Next Articles
CHEN Yongheng, ZUO Xianglin
Received:
Online:
Published:
Contact:
Abstract:
Multijoin query optimization is one of the key problems in database searching. As multicores replace traditional single processor because of the advantages of their high performance and low energy consumption, researches on bottomup dynamic query parallel algorithms have become popular. However, the advantages of topdown dynamic query algorithm can not be replaced by bottomup dynamic query algorithms, such as cut algorithm. Based on bottomup and topdown algorithms, this paper proposes a graph traversal twoway optimization algorithm on the multicores system. The proposed approach makes full use of the advantages of both topdown and bottomup algorithms, gives full play to multicores environments, realizes high performance parallel construction of optimal query plans, thus resolves parallel twoway enumeration join problem. Experimental result shows that the proposed algorithm outperforms existing algorithms, and can effectively increase the speed of database query.
Key words: multicores, query optimization, joinenumeration, dynamic programming
CLC Number:
CHEN Yongheng, ZUO Xianglin. Parallel TwoWay Enumeration Join Based onMulticores Environment[J].Journal of Jilin University Science Edition, 2014, 52(01): 59-64.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: http://xuebao.jlu.edu.cn/lxb/EN/
http://xuebao.jlu.edu.cn/lxb/EN/Y2014/V52/I01/59
Cited