Data exchange deals with the following problem: given an instance over a source schema, a specification of the relationship between the source and the target,and dependencies on the target, construct an instance over a target schema that satisfies the given relationships and dependencies. Recently - for data exchange settings without target dependencies - Libkin (PODS'06) introduced a new concept of solutions based on the closed world assumption (so calledCWA-solutions), and showed that, in some respects, this new notion behaves better than the standard notion of solutions considered in previous papers on data exchange. The present paper extends Libkin's notion of CWA-solutions to data exchange settings with target dependencies. We show that, when restricting attention to data exchange settings with weakly acyclic target dependencies, this new notion behaves similarly as before: the core is the unique "minimal" CWA-solution, and computing CWA-solutions as well as certain answers to positive queries is possible in polynomial time and can be PTIME-hard. However, there may be more than one "maximal" CWA-solution. And going beyond the class of positive queries, we obtain that there are conjunctive queries with (just) one inequality, for which evaluating the certain answers is coNP-hard. Finally, we consider the EXISTENCE-OF-CWA-SOLUTIONS problem: while the problem is tractable for data exchange settings with weakly acyclic target dependencies, it turns out to be undecidable for general data exchange settings. As a consequence, we obtain that also the EXISTENCE-OF-UNIVERSAL-SOLUTIONS problem is undecidable in genera.
[1]
Ronald Fagin,et al.
Data exchange: semantics and query answering
,
2003,
Theor. Comput. Sci..
[2]
Jaroslav Nesetril,et al.
The core of a graph
,
1992,
Discret. Math..
[3]
Ron van der Meyden,et al.
Logical Approaches to Incomplete Information: A Survey
,
1998,
Logics for Databases and Information Systems.
[4]
Phokion G. Kolaitis,et al.
The complexity of data exchange
,
2006,
PODS '06.
[5]
Ronald Fagin,et al.
Locally consistent transformations and query answering in data exchange
,
2004,
PODS '04.
[6]
Leonid Libkin,et al.
Data exchange and incomplete information
,
2006,
PODS '06.
[7]
Aleksander Madry,et al.
Data exchange: On the complexity of answering queries with inequalities
,
2005,
Inf. Process. Lett..
[8]
Alin Deutsch,et al.
Reformulation of XML Queries and Constraints
,
2003,
ICDT.
[9]
Phokion G. Kolaitis.
Schema mappings, data exchange, and metadata management
,
2005,
PODS '05.
[10]
Marcelo Arenas,et al.
XML data exchange: consistency and query answering
,
2005,
PODS '05.
[11]
Ronald Fagin.
Inverting schema mappings
,
2007
.
[12]
Georg Gottlob,et al.
Data exchange: computing cores in polynomial time
,
2006,
PODS '06.
[13]
Ashok K. Chandra,et al.
Optimal implementation of conjunctive queries in relational data bases
,
1977,
STOC '77.