Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Materialized views: techniques, implementations, and applications
Materialized views: techniques, implementations, and applications
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
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
Implementation of algorithms for maximum matching on nonbipartite graphs.
Implementation of algorithms for maximum matching on nonbipartite graphs.
The Data Warehouse Lifecycle Toolkit
The Data Warehouse Lifecycle Toolkit
Materialized view management in peer to peer environment
Proceedings of the International Conference & Workshop on Emerging Trends in Technology
| Hi-index | 0.00 |
The maintenance-cost view-selection problem is one of the important issues in data warehouse design. It is to select a set of materialized views under a maintenance cost constraint (such as maintenance time), in order to minimize the total query processing cost for a given set of queries. The problem has recently received significant attention. Several greedy/heuristic algorithms were proposed. However, the quality of the greedy/heuristic algorithms has not been well analyzed. In this paper, in a multidimensional data warehouse environment, we reexamine the greedy/heuristic algorithms in various settings, and provide users with insights on the quality of these heuristic algorithms.