A uniform approach for selecting views and indexes in a data warehouse

Document Type

Conference Paper

Publication Date

8-1997

Publication Title

Proceedings of the 1997 International Database Engineering and Applications Symposium

First Page

151

Last Page

160

Abstract

Careful selection of aggregate views and some of their most used indexes to materialize in a data warehouse reduces the warehouse query response time as well as warehouse maintenance cost under some storage space constraint. Data Warehouses collect and store large amounts of integrated enterprise data from a number of independent data sources over a long period of time. Warehouse data are used for online analytical processing to assist management in making quick and competitive business decisions. Precomputing and storing summary tables (materialized views) reduces the amount of time needed to recompute these views across several source tables in order to answer complex warehouse queries. A data cube is an elegant way for representing aggregate information in a Warehouse and is an n-dimensional view with 2n subviews. This paper presents a uniform technique for selecting the subviews of the data cube and their indexes to materialize in order to produce the best resultant benefit to the system in terms of query response time and maintenance cost while satisfying some storage space constraint.

DOI

10.1109/IDEAS.1997.625671

Link to Full Text

Share

COinS