Data Exchange with Arithmetic Comparisons ∗

In this paper, the problem of data exchange in the presence of arithmetic comparisons is studied. For this purpose, tuple generating dependencies with arithmetic comparisons (tgd-AC) and arithmetic comparison generating dependencies (acgd) are introduced to capture the need to use arithmetic comparisons in source-totarget and in target constraints (both in their antecedent and in their consequent). Arithmetic comparisons are interpreted over densely totally ordered domains. A chase procedure called AC-chase is introduced to handle such constraints. AC-chase is a tree rather than a sequence and its depth is polynomial on the size of the source instance if the set of target constraints is the union of a set of target acgds with a weakly acyclic set of target tgd-ACs. It is shown that AC-chase computes a universal solution which can be used to compute certain answers for unions of conjunctive queries with arithmetic comparisons (UCQAC). The complexity of existence of a solution is shown to be in NP. The complexity of computing certain answers of UCQAC queries is shown to be coNP-complete. In order to identify polynomial cases, we introduce the succinct AC-chase which however does not always produce a solution. We identify cases where its result is a universal solution and we investigate the syntactic conditions of the query under which we can use the result of succinct AC-chase to compute the certain answers in polynomial time. We show that the latter is also feasible in cases where the result of succinct chase is not a universal solution.

[1]  Catriel Beeri,et al.  A Proof Procedure for Data Dependencies , 1984, JACM.

[2]  Ashish Gupta,et al.  Partial information based on integrity constraint checking , 1995 .

[3]  Alon Y. Halevy,et al.  Queries Independent of Updates , 1993, VLDB.

[4]  Michel de Rougemont,et al.  Approximate Data Exchange , 2007, ICDT.

[5]  Michael J. Maher,et al.  Reasoning with Disjunctive Constrained Tuple-Generating Dependencies , 2001, DEXA.

[6]  Z. Meral Özsoyoglu,et al.  On Efficient Reasoning with Implication Constraints , 1993, DOOD.

[7]  Phokion G. Kolaitis.  Schema mappings, data exchange, and metadata management , 2005, PODS.

[8]  Leonid Libkin,et al.  Data exchange and incomplete information , 2006, PODS '06.

[9]  Georg Gottlob,et al.  Computing cores for data exchange: new algorithms and practical solutions , 2005, PODS '05.

[10]  Ron van der Meyden,et al.  Logical Approaches to Incomplete Information: A Survey , 1998, Logics for Databases and Information Systems.

[11]  Maurizio Lenzerini,et al.  Data integration: a theoretical perspective , 2002, PODS.

[12]  Gösta Grahne,et al.  The Problem of Incomplete Information in Relational Databases , 1991, Lecture Notes in Computer Science.

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

[14]  Chen Li,et al.  On Containment of Conjunctive Queries with Arithmetic Comparisons , 2004, EDBT.

[15]  Catriel Beeri,et al.  Formal Systems for Tuple and Equality Generating Dependencies , 1984, SIAM J. Comput..

[16]  Chen Li,et al.  Answering queries using views with arithmetic comparisons , 2002, PODS '02.

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

[18]  David Maier,et al.  On the foundations of the universal relation model , 1984, TODS.

[19]  Michael J. Maher,et al.  Chasing constrained tuple-generating dependencies , 1996, PODS.

[20]  Phokion G. Kolaitis,et al.  The complexity of data exchange , 2006, PODS '06.

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

[22]  Aleksander Madry,et al.  Data exchange: On the complexity of answering queries with inequalities , 2005, Inf. Process. Lett..

[23]  Marcelo Arenas,et al.  XML data exchange: consistency and query answering , 2005, PODS '05.

[24]  Marianne Baudinet,et al.  Constraint-Generating Dependencies , 1994, PPCP.

[25]  Z. Meral Özsoyoglu,et al.  On the Maintenance of Implication Integrity Constraints , 1993, DEXA.

[26]  Alin Deutsch,et al.  Reformulation of XML Queries and Constraints , 2003, ICDT.

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

[28]  Anthony C. Klug.  On conjunctive queries containing inequalities , 1988, JACM.

[29]  Serge Abiteboul,et al.  Complexity of answering queries using materialized views , 1998, PODS.

[30]  Philip A. Bernstein,et al.  Generic Model Management: A Database Infrastructure for Schema Manipulation , 2001, CoopIS.

[31]  Jennifer Widom,et al.  Constraint checking with partial information , 1994, PODS.

[32]  Ron van der Meyden,et al.  The complexity of querying indefinite data about linearly ordered domains , 1992, J. Comput. Syst. Sci..