Data Exchange: Query Answering for Incomplete Data Sources

Abstract

Data exchange is the problem of transforming data structured under a schema, called the source schema, into data structured under another schema, called the target schema. Existing work on data exchange considers settings where the source instance does not contain incomplete information. In this paper we study semantics and address algorithmic issues for data exchange settings where the source instance may contain incomplete data. We investigate the query answering problem in such data exchange settings. First we give two different meaningful semantics to certain answers: One via the certain answers in the corresponding complete data exchange problems and the other via the set of all solutions of the corresponding complete data exchange problems. We use the chase to compute a universal instance which is materialized over the target schema and is used to compute the certain answers to unions of conjunctive queries. We prove that computing certain answers (under both semantics) for unions of conjunctive queries can be done in polynomial time when the schema mapping contains constraints that consist of a weakly acyclic set of tuple-generating dependencies and equality-generating dependencies.