Supporting hot spots with materialized views

被引:0
作者
Albrecht, J [1 ]
Bauer, A [1 ]
Redert, M [1 ]
机构
[1] Univ Erlangen Nurnberg, Dept Database Syst, D-91058 Erlangen, Germany
来源
DATA WAREHOUSING AND KNOWLEDGE DISCOVERY, PROCEEDINGS | 2000年 / 1874卷
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Since data warehousing has become a major field of research there has been a lot of interest in the selection of materialized views for query optimization. The problem is to find the set of materialized views which yields the highest cost savings for a given set of queries under a certain space constraint. The analytical perspective results in queries which on the one hand require aggregations but oil the other hand arc quite restrictive with regard to the fact data. Usually there are "hot spots", i.e. regions which are requested very frequently, like the current period or the most important product group. However, most algorithms in literature do not consider restrictions of queries and therefore generate only views containing all summary data at a certain aggregation level although the space it occupies could better be used for other, more beneficial views. This article presents an algorithm for the selection of restricted views. The cost savings using this algorithm have been experimentally evaluated to be up to 80% by supplying only 5% additional space.
引用
收藏
页码:47 / 56
页数:10
相关论文
共 12 条
[1]  
ALBRECHT J, 1999, P 1 INT C DAT WAR KN
[2]  
ALBRECHT J, 1999, INT DAT ENG APPL S I
[3]  
Baralis E, 1997, PROCEEDINGS OF THE TWENTY-THIRD INTERNATIONAL CONFERENCE ON VERY LARGE DATABASES, P156
[4]  
COHEN S, 1999, P 18ACM SIGACT SIGMO
[5]  
EZEIFE CI, 1998, P 9 INT C COMP INF I
[6]  
GUPTA H, 1997, P 13 INT C DAT ENG I
[7]  
GUPTA H, 1997, P 6 INT C DAT THEOR
[8]  
HARINARAYAN V, 1996, P 25 INT C MAN DAT S
[9]  
Kimball R, 1996, DATA WAREHOUSE TOOLK
[10]  
SHUKLA A, 1998, P 24 INT C VER LARG