摘要
用视图优化查询是提高数据库响应性能的重要手段,所以减少视图的搜索空间有非常重要的意义。该文提出了视图合并的一种新算法――匹配合并法,该算法大大地扩展了视图合并范围。为了更快地进行匹配合并,还提出了一种有效的索引结构――双分解树,通过分解视图集来达到快速合并视图的目的。实验表明,该合并算法改进了数据库的查询性能。
Materialized views can improve the database＇s performance, but numbers of materialized views will cost lots of spaces. So, it is necessary to decrease the number of the materialized views by merging. This paper gives a new algorithm named match merging. In order to accelerate the merging process, it introduces the two-partitioned tree, which is a kind of index. According to experiment, it is very useful.
出处
《计算机工程》
CAS
CSCD
北大核心
2007年第12期90-92,共3页
Computer Engineering
关键词
物化视图
匹配合并
双分解树
Materialized views
Match merging
Two-partitioned tree
