On the computation of relational view complements

  • Authors:

  • Jens Lechtenbörger;Gottfried Vossen

  • Affiliations:

  • University of Munster, Leonardo-Campus 3, D-48149 Münster, Germany;University of Munster, Leonardo-Campus 3, D-48149 Münster, Germany

  • Venue:
  • Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Views as a means to describe parts of a given data collection play an important role in many database applications. In dynamic environments, where data is updated, not only information provided by views, but also information provided by data sources but missing from views turns out to be relevant: Previously, this missing information was characterized in terms of view complements; recently, it was shown that view complements can be exploited in the context of data warehouses to guarantee desirable warehouse properties such as independence and self-maintainability. As the complete source information is a trivial complement for any given view, a natural interest for "small" or even "minimal" complements arises. However, the computation of minimal complements is still not too well understood. In this paper, we show how to compute reasonably small (and in special cases even minimal) complements for monotonic relational views, where the complexity of constructing complements is polynomial in the size of schema information.