Abstract

A warehouse is a repository of integrated information drawn from remote data sources. Since a warehouse effectively implements materialized views, we must maintain the views as data sources are updated. A lattice framework is used to express dependencies among views. This paper introduces a greedy algorithm that works off this lattice and determines a good set of views to materialize. A program written by Java illustrated the algorithm.