Materialized View Selection in a Data Warehouse

  • Feng Yu
  • Du Xiaoyong
  • Wang Shan
Conference paper

DOI: 10.1007/3-540-45151-X_31

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1846)
Cite this paper as:
Yu F., Xiaoyong D., Shan W. (2000) Materialized View Selection in a Data Warehouse. In: Lu H., Zhou A. (eds) Web-Age Information Management. WAIM 2000. Lecture Notes in Computer Science, vol 1846. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Feng Yu
    • 1
  • Du Xiaoyong
    • 1
  • Wang Shan
    • 1
  1. 1.School of InformationRenmin University of ChinaChina

Personalised recommendations