Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
A survey of logical models for OLAP databases
ACM SIGMOD Record
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Selection of Views to Materialize in a Data Warehouse
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
| Hi-index | 0.00 |
A data warehouse stores huge amounts of data collected from multiple sources and enables users to query that data for analytical and reporting purposes. Data in a data warehouse can be represented as a multidimensional cube. Data warehouse queries tend to be very complex, thus their evaluation requires long hours. Precomputing a proper set of the queries (building subcubes) may significantly reduce the query execution time, though it requires additional storage space as well as maintenance time for updating the subcubes. Creating suitable indexes on the subcubes may have additional impact on the query evaluation time. Proposed approach involves using evolutionary computation to select the set of subcubes and indexes that would minimize the query execution time, given a set of queries and available storage space limit.