On the computation of relational view complements

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.

[1]  Jennifer Widom,et al.  Making views self-maintainable for data warehousing , 1996, Fourth International Conference on Parallel and Distributed Information Systems.

[2]  Gottfried Vossen Data models, database languages and database management systems , 1990, International computer science series.

[3]  Jens Lechtenbörger,et al.  Data warehouse schema design , 2001, DISDBIS.

[4]  Mirian Halfeld Ferrari Alves,et al.  Efficient maintenance of temporal data warehouses , 2000, Proceedings 2000 International Database Engineering and Applications Symposium (Cat. No.PR00789).

[5]  Matteo Golfarelli,et al.  A methodological framework for data warehouse design , 1998, DOLAP '98.

[6]  Jennifer Widom,et al.  Lineage tracing for general data warehouse transformations , 2003, The VLDB Journal.

[7]  Gottfried Vossen,et al.  Monotonic complements for independent data warehouses , 2001, The VLDB Journal.

[8]  Matteo Golfarelli,et al.  Designing the Data Warehouse: Key Steps and Crucial Issues , 1999 .

[9]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[10]  Christos H. Papadimitriou,et al.  Updates of Relational Views , 1984, JACM.

[11]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[12]  Jeffrey D. Ullman,et al.  On complementary and independent mappings on databases , 1984, SIGMOD '84.

[13]  H. V. Jagadish,et al.  Data Integration using Self-Maintainable Views , 1996, EDBT.

[14]  Mihalis Yannakakis,et al.  Equivalences Among Relational Expressions with the Union and Difference Operators , 1980, J. ACM.

[15]  Nicolas Spyratos,et al.  Update semantics of relational views , 1981, TODS.

[16]  Stephen J. Hegner Unique Complements and Decomposition of Database Schemata , 1994, J. Comput. Syst. Sci..

[17]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[18]  Peter Honeyman Extension Joins , 1980, VLDB.

[19]  Abraham Silberschatz,et al.  Database System Concepts , 1980 .