摘要
传统的数据仓库优化技术在大表的选择上只能实现降低查询处理时间或减少存储以及维护开销中的一个,无法达到同时优化的效果。在传统的优化技术上,利用水平分区和位图索引方法的特点,提出了HP→BIs方法。实验结果表明,通过该方法可以同时降低查询处理时间和减少存储以及维护成本。
Traditional selecting optimization structures at large table in data warehouse can only either shorten the time of query processing, or reduce the storage and maintenance overhead. It can't achieve a combined effect at the same time. Based on the traditional optimization techniques, this paper proposes a new approach, namely, HP→BIs, by exploiting their similarities of horizontal partitioning and bitmap indexes. Experimental results show that with this approach, we can significantly shorten the time of query processing, reduce the storage and maintenance cost.
出处
《计算机系统应用》
2011年第9期234-237,229,共5页
Computer Systems & Applications
基金
国家自然科学基金(61070194)
关键词
数据仓库
决策支持系统
位图索引
水平分区
性能优化
data warehouse
decision support system
bitmap indexes
horizontal partitioning
optimization