Chapter

Web-Age Information Management

Volume 1846 of the series Lecture Notes in Computer Science pp 323-328

Date:

Materialized View Selection in a Data Warehouse

  • Feng YuAffiliated withSchool of Information, Renmin University of China
  • , Du XiaoyongAffiliated withSchool of Information, Renmin University of China
  • , Wang ShanAffiliated withSchool of Information, Renmin University of China

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Selecting views to be materialized is one of the most important decisions in designing a warehouse. In this paper we present algorithms for how to select a set of views to be materialized so as to achieve both good query performance and low view maintain cost under a storage space constraint. We generated the candidate views based on Query Frames which represent the essential characters of queries. We give an algorithm to select an optimal set of views to be materialized first and then give a feasible algorithm which generates a reasonable solution.