Query optimization by simulated annealing
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Materialized view maintenance and integrity constraint checking: trading space for time
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
Selection of Views to Materialize Under a Maintenance Cost Constraint
ICDT '99 Proceedings of the 7th International Conference on Database Theory
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
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Algorithms for Materialized View Design in Data Warehousing Environment
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
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
Parallel Simulated Annealing for Materialized View Selection in Data Warehousing Environments
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
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
An effective and adaptive data cleaning technique for colossal RFID data sets in healthcare
WSEAS Transactions on Information Science and Applications
A survey of view selection methods
ACM SIGMOD Record
Hi-index | 0.00 |
In order to facilitate query processing, the information contained in data warehouses is typically stored as a set of materialized views. Deciding which views to materialize presents a considerable challenge. The task is to select from a very large search space a set of views that minimizes view maintenance and query processing costs. Heuristic methods have been employed to find near optimal solutions and recent genetic algorithms have significantly improved the quality of the obtained solutions. In this paper we introduce a new approach for materialized view selection that is based on Simulated Annealing in conjunction with the use of a Multiple View Processing Plan (MVPP). Our experiments show that our new method provides a further significant improvement in the quality of the obtained set of materialized views, leading to a further significant improvement in query processing time and view maintenance costs for data warehousing systems.