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
Parallel systems in the data warehouse
Parallel systems in the data warehouse
Partial-Sum Queries in OLAP Data Cubes Using Covering Codes
IEEE Transactions on Computers
Making multiple views self-maintainable in a data warehouse
Data & Knowledge Engineering
Data & Knowledge Engineering
Data mining: concepts and techniques
Data mining: concepts and techniques
Materialized view and index selection tool for Microsoft SQL server 2000
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Selection of Views to Materialize Under a Maintenance Cost Constraint
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Materialized View Selection for Multidimensional Datasets
VLDB '98 Proceedings of the 24rd 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
Answering Multidimensional Queries on Cubes Using Other Cubes
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Maintaining Data Cubes under Dimension Updates
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Efficient approaches for materialized views selection in a data warehouse
Information Sciences: an International Journal
| Hi-index | 0.00 |
View Materialization is an effective method to increase query efficiency in a data warehouse. However, one encounters the problem of space insufficiency if all possible views are materialized in advance. Reducing query time by means of selecting a proper set of materialized views with a lower cost is crucial for efficient data warehousing. In addition, the costs of data warehouse creation, query, and maintenance have to be taken into account while views are materialized. The purpose of this research is to select a proper set of materialized views under the storage and cost constraints and to help speedup the entire data warehousing process. We propose a cost model for data warehouse query and maintenance along with an efficient view selection algorithm, which uses the gain and loss indices. The main contribution of our paper is to speedup the selection process of materialized views. The second one is to reduce the total cost of data warehouse query and maintenance.