Abstract—A data warehouse (DW) contains multiple views accessed by queries. One of the most important decisions in designing a DW is selecting views to materialize for the purpose of efficiently supporting decision making. The search space for possible materialized views is exponentially large. Therefore heuristics have been used to search for a near optimal solution. In this paper, we explore the use of an evolutionary algorithm for materialized view selection based on multiple global processing plans for queries. We apply a hybrid evolutionary algorithm to solve three related problems. The first is to optimize queries. The second is to choose the best global processing plan from multiple global processing plans. The third is to select materialized views from a given global processing plan. Our experiment shows that the hybrid evolutionary algorithm delivers better performance than either the evolutionary algorithm or heuristics used alone in terms of the minimal query and maintenance cost and the evaluation cost to obtain the minimal cost. Index Terms—Data mining, data warehousing, evolutionary algorithms, materialized view selection. I.
|
1082
|
Genetic algorithms in search, optimization and machine learning
– Goldberg
- 1989
|
|
377
|
Implementing Data Cubes Efficiently
– Harinarayan, Rajaraman, et al.
- 1996
|
|
247
|
editors. Handbook of Evolutionary Computation
– Bäck, Fogel, et al.
- 1997
|
|
139
|
Index Selection for OLAP
– Gupta, Harinarayan, et al.
- 1997
|
|
123
|
Multiple-query optimization
– Sellis
- 1988
|
|
104
|
Materialized view selection in a multidimensional database
– Baralis, Paraboschi, et al.
- 1997
|
|
83
|
Parametric query optimization
– Ioannidis, Ng, et al.
- 1992
|
|
79
|
Materialized view maintenance and integrity constraint checking: Trading space for time
– Ross, Srivastava, et al.
- 1996
|
|
73
|
Algorithms for materialized view design in data warehousing environment
– YANG, KARLAPALEM, et al.
- 1997
|
|
54
|
Selection of views to materialize under maintenance cost constraint
– GUPTA, MUMICK
- 1999
|
|
54
|
An overview of query optimization in relational systems
– Chaudhuri
- 1998
|
|
52
|
Data Warehouse Configuration
– Theodoratos, Sellis
- 1997
|
|
42
|
Heuristic and Randomized Optimization for the Join Ordering Problem
– Steinbrunn, Moerkotte, et al.
- 1997
|
|
32
|
Physical database design for data warehouses
– Labio, Quass, et al.
- 1997
|
|
28
|
Implementing data cubes eciently
– Harinarayan, Rajaraman, et al.
- 1996
|
|
24
|
Improvements on a heuristic algorithm for multiple-query optimization
– Shim, Sellis, et al.
- 1994
|
|
20
|
A genetic algorithm for database query optimization
– Bennett, Ferris, et al.
- 1991
|
|
19
|
Sga-c: A c-language implementation of a simple genetic algorithm
– Smith, Goldberg, et al.
- 1991
|
|
11
|
On the Complexity of Distributed Query Optimization
– Wang, Chen
- 1996
|
|
8
|
Data warehouse con
– Theodoratos, Sellis
- 1997
|
|
7
|
Genetic programming in database query optimization
– Stillger, Spiliopoulou
- 1996
|
|
7
|
Genetic algorithm for materialized view selection in data warehouse environments
– Zhang, Yang
- 1999
|
|
6
|
Processing multiple queries in database systems
– Charkravarthy, Minker
- 1982
|
|
5
|
Research problems in data warehouse
– Widom
- 1995
|
|
4
|
The genetic query optimizer
– Ho
- 1994
|
|
3
|
et al. Index Selection for OLAP
– Gupta
- 1997
|
|
3
|
Genetic algorithm optimisation of distributed database queries
– Gregory
- 1998
|
|
1
|
Evolving materialized views in data warehouse
– Zhang, Yao, et al.
- 1999
|
|
1
|
Genetic algorithm optimization of distributed database queries
– Gregory
- 1998
|
|
1
|
The genetic query optimizer,” in Genetic Algorithms at Stanford
– Ho, Lumpkin
- 1994
|
|
1
|
MIT), \Galib: A c++ genetic algorithms library," http://lancet.mit.edu/galib-2.4/GAlib.html
– Sichuan
- 1998
|
