摘要
文章提出了一种基于快速分解模拟退火算法的全局查询优化算法。快速分解模拟退火算法是一种改进的模拟退火算法,它退火时间短,收敛速度快,磁盘I/O开销小。仿真结果表明,该算法在数据集成系统环境中,无论参与查询的关系数目多少,均有较好的查询优化性能。
This paper proposes a global query optimization algorithm based on a faster decomposition-based simulated annealing algorithm.The faster decomposition-based simulated annealing algorithm is an improved simulated annealing algorithm.It can shorten annealing time and quicken convergence speed and dramatically reduce the disk I/O activities.Simulation results show that this algorithm has a better performance of query optimization in data integration system,no matter how many the query relations are.
出处
《计算机工程与应用》
CSCD
北大核心
2001年第23期88-90,共3页
Computer Engineering and Applications
基金
广东省自然科学基金项目资助(编号:990582)
