A formal perspective on the view selection problem
The VLDB Journal — The International Journal on Very Large Data Bases
Materialization of fragmented views in multidimensional databases
Data & Knowledge Engineering
Fundamentals of Database Systems, Fourth Edition
Fundamentals of Database Systems, Fourth Edition
A genetic algorithm for the index selection problem
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Automatic selection of bitmap join indexes in data warehouses
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
An evolutionary approach to schema partitioning selection in a data warehouse
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Clustering-based materialized view selection in data warehouses
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Materialized view selection as constrained evolutionary optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Framework for Workflow Gridication of Genetic Algorithms in Java
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part III
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
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
Hi-index | 0.00 |
In this paper we present two novel algorithms for generalized problem of selection of optimal set of views, their optimal vertical fragmentation and their optimal set of indexes. The algorithms are hybrid, i.e. they are combination of Greedy and Genetic Algorithm. We present our experimental results and show that our algorithms significantly improve the efficiency of the optimization process for different input parameters. The results show that those algorithms outperforms Stochastic Ranking evolutionary (Genetic) Algorithm - SRGA by 60% - 280% in the speed of finding optimal (or near optimal) solutions.