摘要
受限物化视图的选择是当前数据仓库研究的最重要的问题之一,且其是个NP问题。本文通过对视图与查询关系的研究,提出了一种选择物化视图的两阶段算法框架,首先利用候选视图选择算法缩小视图选择的范围,而后利用遗传算法解决受限物化视图的选择问题。
Materialized view selection under cost constraint is one of the most important issues in data warehouse development,and it is a NP.By deeply researched the relationship of views and queries,a tow-phases algorithm is designed to resolve the problem.Firstly,candidate views selection algorithm is used to reduce the selection range.Based on that,we has successfully resolve the problem of materialized views selection with Genetic algorithm.
出处
《网络安全技术与应用》
2007年第6期61-62,73,共3页
Network Security Technology & Application
关键词
物化视图
候选视图
遗传算法
materialized view
candidate views
genetic algorithm
