Algorithms
Optimal update policies for distributed materialized views
Management Science
Multi-table joins through bitmapped join indices
ACM SIGMOD Record
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Implementing data cubes efficiently
Materialized views
Finding an efficient rewriting of OLAP queries using materialized views in data warehouses
Decision Support Systems
Decision Support Systems - Special issue: Decision support systems: Directions for the next decade
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
Data Mining and Knowledge Discovery
View selection using randomized search
Data & Knowledge Engineering
Incremental Recomputation of Active Relational Expressions
IEEE Transactions on Knowledge and Data Engineering
Join Index, Materialized View, and Hybrid-Hash Join: A Performance Analysis
Proceedings of the Sixth International Conference on Data Engineering
Including Group-By in Query Optimization
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Aggregate-Query Processing in Data Warehousing Environments
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Genetic Algorithm for Materialized View Selection in Data Warehouse Environments
DaWaK '99 Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery
Space-efficient cubes for OLAP range-sum queries
Decision Support Systems
Selection of Views to Materialize in a Data Warehouse
IEEE Transactions on Knowledge and Data Engineering
How to Solve It: Modern Heuristics
How to Solve It: Modern Heuristics
Data warehouse governance: best practices at blue cross and blue shield of North Carolina
Decision Support Systems
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
VLDB '80 Proceedings of the sixth international conference on Very Large Data Bases - Volume 6
The Art of Computer Programming: Combinatorial Algorithms, Part 1
The Art of Computer Programming: Combinatorial Algorithms, Part 1
A survey of view selection methods
ACM SIGMOD Record
| Hi-index | 0.00 |
A common problem in data warehousing is reduction of response time for ad hoc queries. To reduce query processing time, a selected number of views are materialised. Selecting the optimal number of views in a data warehouse is known to be an NP-complete problem as no feasible deterministic algorithm exists. In this paper, we discuss a weighted materialised view selection MVS problem where both the amount and importance of data retrieved are considered. Existing versions of the MVS problem only consider the amount of data retrieved and ignore the relative importance of data to the data warehouse user. We apply an evolutionary algorithm EA to solve the weighted MVS problem in which a higher priority is given to the optimisation of high-demand queries over infrequently-used queries. Several experiments are conducted on large sized datasets that are commonly found in real world applications. EA results are compared to those obtained by the best known heuristic algorithm for this weighted MVS problem from the current literature. EA is shown to outperform the heuristic algorithm for all experiments conducted.