Applying evolutionary algorithms to materialized view selection in a data warehouse

被引:32
作者
Horng, JT
Chang, YJ
Liu, BJ
机构
[1] Department of Computer Science and Information Engineering, National Central University, Taiwan
关键词
data warehouses; genetic algorithms; genomes; materialized views;
D O I
10.1007/S00500-002-0243-1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Effective analysis of genome sequences and associated functional data requires access to many different kinds of biological information. A data warehouse [14,16] plays an important role for storage and analysis for genome sequence and functional data. A data warehouse stores lots of materialized views to provide an efficient decision-support or OLAP queries. The view-selection problem addresses to select a fittest set of materialized views from a variety of MVPPs 0 forms a challenge in data warehouse research. In this paper, we present genetic algorithm to choose materialized views. We also use experiments to demonstrate the power of our approach.
引用
收藏
页码:574 / 581
页数:8
相关论文
共 18 条
[1]  
AGRAWAL D, 1997, SIGMOD, P417
[2]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[3]  
CHANG CL, 1996, THESIS NATL TSING HU
[4]  
CORNELL M, 2000, BIOINFORMATICS, V16, P548
[5]  
DAVIS L, 1987, GENETIC ALGORITHMS S, P1
[6]  
ELMASRI R, 1994, FUNDAMENTALS DATABAS
[7]  
GUPTA A, 1995, IEEE DATA ENG B, V18, P3
[8]  
GUPTA H, 1997, P 23 VLDB C ATH GREE, P156
[9]  
HORNG JT, 1999, LAT BREAK PAP GEN EV, P107
[10]  
ISHIBUCHI H, 1997, P 7 INT C GEN ALG, P505