Principles of artificial intelligence
Principles of artificial intelligence
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
View indexing in relational databases
ACM Transactions on Database Systems (TODS)
Physical Database Design for Data Warehouses
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
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
Designing the Global Data Warehouse with SPJ Views
CAiSE '99 Proceedings of the 11th International Conference on Advanced Information Systems Engineering
A Logical Model for Data Warehouse Design and Evolution
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Modelling and Optimisation Issues for Multidimensional Databases
CAiSE '00 Proceedings of the 12th International Conference on Advanced Information Systems Engineering
| Hi-index | 0.00 |
A Data Warehouse (DW) can be abstractly seen as a set of materialized views defined over relations that are stored in distributed heterogeneous databases. The selection of views for materialization in a DW is thus an important decision problem. The objective is the minimization of the combination of the query evaluation and view maintenance costs. In this paper we expand on our previous work by proposing new heuristic algorithms for the DW design problem. These algorithms are described in terms of a state space search problem, and are guaranteed to deliver an optimal solution by expanding only a small fraction of the states produced by the (original) exhaustive algorithm.