Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A progressive view materialization algorithm
Proceedings of the 2nd ACM international workshop on Data warehousing and OLAP
Incremental Design of a Data Warehouse
Journal of Intelligent Information Systems - Data warehousing and knowledge discovery
Materialized view selection under the maintenance time constraint
Data & Knowledge Engineering
View relevance driven materialized view selection in data warehousing environment
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
An adaptive peer-to-peer network for distributed caching of OLAP results
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
View selection for designing the global data warehouse
Data & Knowledge Engineering - Data warehousing
Achieving scalability in OLAP materialized view selection
Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP
View selection using randomized search
Data & Knowledge Engineering
A formal perspective on the view selection problem
The VLDB Journal — The International Journal on Very Large Data Bases
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization
Proceedings of the 5th International Conference on Genetic Algorithms
Materialized Views Selection in a Multidimensional Database
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Materialized View Selection for Multidimensional Datasets
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Automated Selection of Materialized Views and Indexes in SQL Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Evolving Objects: A General Purpose Evolutionary Computation Library
Selected Papers from the 5th European Conference on Artificial Evolution
A Randomized Approach for the Incremental Design of an Evolving Data Warehouse
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
Introduction to Evolutionary Computing
Introduction to Evolutionary Computing
An elitist genetic algorithm for multiobjective optimization
Metaheuristics
Selection of Views to Materialize in a Data Warehouse
IEEE Transactions on Knowledge and Data Engineering
An evolutionary approach to materialized views selection in a datawarehouse environment
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Materialized view selection as constrained evolutionary optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
ROLAP implementations of the data cube
ACM Computing Surveys (CSUR)
Cooperative caching for grid-enabled OLAP
International Journal of Grid and Utility Computing
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
Materialised view construction in data warehouse for decision making
International Journal of Business Information Systems
Hi-index | 0.00 |
On-Line Analytical Processing (OLAP) tools are frequently used in business, science and health to extract useful knowledgefrom massive databases. An important and hard optimization problem in OLAP data warehouses is the view selection problem, consisting of selecting a set of aggregate views of the data for speeding up future query processing. A common variant of the view selection problem addressed in the literature minimizes the sum of maintenance cost and query time on the view set. Converting what is inherently an optimization problem with multiple conflicting objectives into one with a single objective ignores the need and value of a variety of solutions offering various levels of trade-off between the objectives. We apply two non-elitist multiobjective evolutionary algorithms (MOEAs) to view selection under a size constraint. Our emphasis is to determine the suitability of the combination of MOEAs with constraint handling to the view selection problem, compared to a widely used greedy algorithm. We observe that the evolutionary process mimics that of the greedy in terms of the convergence process in the population. The MOEAs are competitive with the greedy on a variety of problem instances, often finding solutions dominating it in a reasonable amount of time.