Querying Data Exchange Settings Beyond Positive Queries

TL;DR

This paper introduces a new semantics for data exchange that handles general queries, maintains compatibility with positive query semantics, and balances expressiveness with computational complexity.

Contribution

The paper proposes a novel semantics for data exchange that extends to general queries while preserving classical semantics for positive queries and ensuring manageable complexity.

Findings

Query answering is undecidable in general under the new semantics.

It is $ ext{coNP}$-complete for weakly-acyclic dependencies.

Exact answers can be computed using logic programs with choice.

Abstract

Data exchange, the problem of transferring data from a source schema to a target schema, has been studied for several years. The semantics of answering positive queries over the target schema has been defined in early work, but little attention has been paid to more general queries. A few proposals of semantics for more general queries exist but they either do not properly extend the standard semantics under positive queries, giving rise to counterintuitive answers, or they make query answering undecidable even for the most important data exchange settings, e.g., with weakly-acyclic dependencies. The goal of this paper is to provide a new semantics for data exchange that is able to deal with general queries. At the same time, we want our semantics to coincide with the classical one when focusing on positive queries, and to not trade-off too much in terms of complexity of query answering. We show that query answering is undecidable in general under the new semantics, but it is $\co\NP\complete$ when the dependencies are weakly-acyclic. Moreover, in the latter case, we show that exact answers under our semantics can be computed by means of logic programs with choice, thus exploiting existing efficient systems. For more efficient computations, we also show that our semantics allows for the construction of a representative target instance, similar in spirit to a universal solution, that can be exploited for computing approximate answers in polynomial time. Under consideration in Theory and Practice of Logic Programming (TPLP).