一种基于最优子树的数据库多连接查询优化混合算法

A Combinational Algorithm for Database Multi-connection Query Optimization Based on the Optimal Sub-tree

连接查询优化技术是并行查询和提高数据库性能的一种重要技术,连接的优化技术是NPC难题,其中GMC算法是处理数据库连接查询优化的一种经典启发式算法。基于GMC算法结合局部穷举搜索构建最优子树,扩大更多节点的操作次序最优,提出一种最优子树混合启发式算法。通过实验分析和理论证明它在同样的时间复杂度情况下能求得更好的解。

The technique of connection query optimization is a practical and commonly used technology to enhance the database performance. The connection optimization is one of hard problems of the typical NPC. The GMC algorithm is a commonly adopted heuristic algorithm to deal with the database connection query optimization.This paper was based on GMC algorithm and local exhaustive search. It expanded more optimal operation order node. It proposed a sub-tree mixed aggregate algorithm. Through experimental tests and theoretical analysis,it concluded that this method was able to yield a better solution in the same time complexity.