Algorithms for materialized view design in data warehousing environment

Jian Yang, Kamalakar Karlapalem, Qing Li

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

202 Citations (Scopus)

Abstract

Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a frame work for analyzing the issues in selecting views to materialize so as to achieve the best combination of good query performance and low view maintenance. We first develop a heuristic algorithm which can provide a feasible solution based on individual optimal query plans. We also map the materialized view design problem as 0-1 integer programming problem, whose solution can guarantee an optimal solution.

Original languageEnglish
Title of host publicationProceedings of the 23rd International Conference on Very Large Databases, VLDB 1997
EditorsMatthias Jarke
Place of PublicationSan Fransisco, CA
PublisherMorgan Kaufmann
Pages136-145
Number of pages10
ISBN (Electronic)1558604707, 9781558604704
Publication statusPublished - 1997
Externally publishedYes
Event23rd International Conference on Very Large Databases, VLDB 1997 - Athens, Greece
Duration: 26 Aug 199729 Aug 1997

Other

Other23rd International Conference on Very Large Databases, VLDB 1997
CountryGreece
CityAthens
Period26/08/9729/08/97

Fingerprint

Dive into the research topics of 'Algorithms for materialized view design in data warehousing environment'. Together they form a unique fingerprint.

Cite this