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
ROLAP implementations of the data cube
ACM Computing Surveys (CSUR)
Hybrid greedy and genetic algorithms for optimization of relational data warehouses
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Complete algorithm for fragmentation in data warehouse
AIKED'08 Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases
Improvement of Data Warehouse Optimization Process by Workflow Gridification
ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
Algorithms for data warehouse design to enhance decision-making
WSEAS Transactions on Computer Research
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Horizontal partitioning by predicate abstraction and its application to data warehouse design
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
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
Dynamic view selection for OLAP
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
SAGA: a combination of genetic and simulated annealing algorithms for physical data warehouse design
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
A survey of view selection methods
ACM SIGMOD Record
RDF pattern matching using sortable views
Proceedings of the 21st ACM international conference on Information and knowledge management
| Hi-index | 0.00 |
One of the important issues in data warehouse development is the selection of a set of views to materialize in order to accelerate a large number of on-line analytical processing (OLAP) queries. The maintenance-cost view-selection problem is to select a set of materialized views under certain resource constraints for the purpose of minimizing the total query processing cost. However, the search space for possible materialized views may be exponentially large. A heuristic algorithm often has to be used to find a near optimal solution. In this paper, for the maintenance-cost view-selection problem, we propose a new constrained evolutionary algorithm. Constraints are incorporated into the algorithm through a stochastic ranking procedure. No penalty functions are used. Our experimental results show that the constraint handling technique, i.e., stochastic ranking, can deal with constraints effectively. Our algorithm is able to find a near-optimal feasible solution and scales with the problem size well.