Stanford InfoLab Publication Server

Selection of Views to Materialize in a Data Warehouse

Gupta, H. (1996) Selection of Views to Materialize in a Data Warehouse. Technical Report. Stanford InfoLab. (Publication Note: Database Theory - ICDT '97, 6th International Conference, Delphi, Greece, January 8-10, 1997)




A data warehouse stores materialized views of data from one or more sources, with the purpose of effciently implementing decisionsupport or OLAP queries. One of the most important decisions in designing a data warehouse is the selection of materialized views to be maintained at the warehouse. The goal is to select an appropriate set of views that minimizes total query response time and the cost of maintaining the selected views, given a limited amount of resource, e.g., materialization time, storage space etc. In this article, we develop a theoretical framework for the general problem of selection of views in a data warehouse. We present competitive polynomial-time heuristics for selection of views to optimize total query response time, for some important special cases of the general data warehouse scenario, viz.: (i) an AND view graph, where each query/view has a unique evaluation, and (ii) an OR view graph, in which any view can be computed from any one of its related views, e.g., data cubes. We extend the algorithms to the case when there is a set of indexes associated with each view. Finally, we extend our heuristic to the most general case of AND-OR view graphs.

Item Type:Techreport (Technical Report)
Uncontrolled Keywords:Views, data warehouse, materialized views, AND-OR graphs, selection algorithms
Subjects:Computer Science > Data Warehousing
Related URLs:Project Homepage
ID Code:161
Deposited By:Import Account
Deposited On:25 Feb 2000 16:00
Last Modified:08 Dec 2008 15:27

Download statistics

Repository Staff Only: item control page