Towards an analytic framework for analysing the computation time of evolutionary algorithms
Artificial Intelligence
Journal of Computer Science and Technology
Multiobjective genetic algorithms for materialized view selection in OLAP data warehouses
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Simulated annealing for materialized view selection in data warehousing environment
DBA'06 Proceedings of the 24th IASTED international conference on Database and applications
Efficient approaches for materialized views selection in a data warehouse
Information Sciences: an International Journal
A Query-Driven Approach to the Design and Management of Flexible Database Systems
Journal of Management Information Systems
Information Sciences: an International Journal
Parallel Simulated Annealing for Materialized View Selection in Data Warehousing Environments
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
An efficient query evaluation in a mediator based on implementation plan
Information Sciences: an International Journal
A metamorphosis algorithm for the optimization of a multi-node OLAP system
EPIA'07 Proceedings of the aritficial intelligence 13th Portuguese conference on Progress in artificial intelligence
The minimum incremental maintenance of materialized views in data warehouse
CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 3
Mining information for constructing materialised views
International Journal of Information and Communication Technology
Efficient processing of monotonic linear progressive queries via dynamic materialized views
Proceedings of the 2010 Conference of the Center for Advanced Studies on Collaborative Research
Modeling view selection as a constraint satisfaction problem
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
A materialized-view based technique to optimize progressive queries via dependency analysis
Proceedings of the 2011 Conference of the Center for Advanced Studies on Collaborative Research
A survey of view selection methods
ACM SIGMOD Record
Materialized views selection for answering queries
ICDEM'10 Proceedings of the Second international conference on Data Engineering and Management
A comprehensive study of view maintenance approaches in data warehousing evolution
ACM SIGSOFT Software Engineering Notes
Exploiting data access for dynamic fragmentation in data warehouse
International Journal of Intelligent Information and Database Systems
| Hi-index | 0.00 |
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