Containment of Schema Mappings for Data Exchange (Preliminary Report)

In data exchange, data are materialised from a source schema to a target schema, according to suitable source-to-target constraints. Constraints are also expressed on the target schema to represent the domain of interest. A schema mapping is the union of the source-to-target and of the target constraints. In this paper, we address the problem of containment of schema mappings for data exchange, which has been recently proposed in this framework as a step towards the optimization of data exchange settings. We refer to a natural notion of containment that relies on the behaviour of schema mappings with respect to conjunctive query answering, in the presence of so-called LAV TGDs as target constraints. Our contribution is a practical technique for testing the containment based on the existence of a homomorphism between special "dummy" instances, which can be easily built from schema mappings. We argue that containment of schema mappings is decidable for most practical cases, and we set the basis for further investigations in the topic. This paper extends our preliminary results.

[1]  Andrea Calì,et al.  Querying the deep web , 2010, EDBT '10.

[2]  Davide Martinenghi Simplification of Integrity Constraints with Aggregates and Arithmetic Built-Ins , 2004, FQAS.

[3]  Henning Christiansen,et al.  Symbolic constraints for meta-logic programming , 2000, Appl. Artif. Intell..

[4]  Georg Gottlob,et al.  Data exchange: computing cores in polynomial time , 2006, PODS '06.

[5]  Andrea Calì,et al.  On the Containment of Schema Mappings , 2008, SEBD.

[6]  Davide Martinenghi,et al.  Getting Rid of Straitjackets for Flexible Integrity Checking , 2007 .

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

[8]  Alberto O. Mendelzon,et al.  Tableau Techniques for Querying Information Sources through Global Schemas , 1999, ICDT.

[9]  Hendrik Decker,et al.  Modeling, Measuring and Monitoring the Quality of Information , 2009, ER Workshops.

[10]  Andrea Calì,et al.  A general datalog-based framework for tractable query answering over ontologies , 2009, SEBD.

[11]  Ronald Fagin,et al.  Data exchange: semantics and query answering , 2003, Theor. Comput. Sci..

[12]  Alfred V. Aho,et al.  Efficient optimization of a class of relational expressions , 1979, TODS.

[13]  Hendrik Decker,et al.  Avenues to Flexible Data Integrity Checking , 2006, 17th International Workshop on Database and Expert Systems Applications (DEXA'06).

[14]  David Maier,et al.  Testing implications of data dependencies , 1979, SIGMOD '79.

[15]  Andrea Calì,et al.  Querying incomplete data over extended ER schemata , 2010, Theory and Practice of Logic Programming.

[16]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[17]  Davide Martinenghi,et al.  Top-k bounded diversification , 2012, SIGMOD Conference.

[18]  Henning Christiansen,et al.  Simplification of Database Integrity Constraints Revisited: A Transformational Approach , 2003, LOPSTR.

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

[20]  David S. Johnson,et al.  Testing containment of conjunctive queries under functional and inclusion dependencies , 1982, J. Comput. Syst. Sci..