摘要
提出一种基于图的适应性多连接查询优化算法,分析关系结果集到达时间和结果集大小之间的关系,借鉴适应性查询优化的动态调整思想,对基于图的多连接查询进行改进。仿真实验结果表明,该算法在最好情况下的时间复杂度为O(n),且能有效提高查询效率。
A novel graph-based adaptive multi-join query optimization algorithm is proposed. The relationship between the arrival time of relation result set and its size is analyzed. The graph-based multi-join query is improved with the idea of adaptive query optimization and dynamic adjustment. Simulation experimental results show the time complexity of this algorithm is O(n) in case of best situation, and improves the efficiency of query.
出处
《计算机工程》
CAS
CSCD
北大核心
2009年第10期80-82,共3页
Computer Engineering
关键词
基于图的优化算法
多连接查询
数据集成
graph-based optimization algorithm
multi-join query
data integration