吉林大学学报（理学版）
吉林大學學報（理學版）
길림대학학보（이학판）
JOURNAL OF JILIN UNIVERSITY(SCIENCE EDITION)
2014年
1期
59-64
,共6页
多核%查询优化%链接枚举%动态规划
多覈%查詢優化%鏈接枚舉%動態規劃
다핵%사순우화%련접매거%동태규화
multi-cores%query optimization%j oin-enumeration%dynamic programming
基于多核处理器，结合自底向上和自顶向下两种算法，提出一种图遍历驱动的双向优化算法，该算法充分利用两种遍历算法的优点，并发挥多核环境的优势，实现了最优查询计划的高性能并行构建，解决了并行双向枚举连接问题。实验结果表明，该算法的性能优于已有算法，可明显提高数据库查询速度。
基于多覈處理器，結閤自底嚮上和自頂嚮下兩種算法，提齣一種圖遍歷驅動的雙嚮優化算法，該算法充分利用兩種遍歷算法的優點，併髮揮多覈環境的優勢，實現瞭最優查詢計劃的高性能併行構建，解決瞭併行雙嚮枚舉連接問題。實驗結果錶明，該算法的性能優于已有算法，可明顯提高數據庫查詢速度。
기우다핵처리기，결합자저향상화자정향하량충산법，제출일충도편력구동적쌍향우화산법，해산법충분이용량충편력산법적우점，병발휘다핵배경적우세，실현료최우사순계화적고성능병행구건，해결료병행쌍향매거련접문제。실험결과표명，해산법적성능우우이유산법，가명현제고수거고사순속도。
Multi-j oin query optimization is one of the key problems in database searching.As multi-cores replace traditional single processor because of the advantages of their high performance and low energy consumption, researches on bottom-up dynamic query parallel algorithms have become popular.However,the advantages of top-down dynamic query algorithm can not be replaced by bottom-up dynamic query algorithms,such as cut algorithm.Based on bottom-up and top-down algorithms,this paper proposes a graph traversal two-way optimization algorithm on the multi-cores system.The proposed approach makes full use of the advantages of both top-down and bottom-up algorithms, gives full play to multi-cores environments, realizes high performance parallel construction of optimal query plans, thus resolves parallel two-way enumeration j oin problem. Experimental result shows that the proposed algorithm outperforms existing algorithms,and can effectively increase the speed of database query.
