Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema that reflects the source data as accurately as possible. In this paper, we address foundational and algorithmic issues related to the semantics of data exchange and to the query answering problem in the context of data exchange. These issues arise because, given a source instance, there may be many target instances that satisfy the constraints of the data exchange problem. We give an algebraic specification that selects, among all solutions to the data exchange problem, a special class of solutions that we call universal. A universal solution has no more and no less data than required for data exchange and it represents the entire space of possible solutions. We then identify fairly general, and practical, conditions that guarantee the existence of a universal solution and yield algorithms to compute a canonical universal solution efficiently. We adopt the notion of “certain answers ” in indefinite databases for the semantics for query answering in data exchange. We investigate the computational complexity of computing the certain answers in this context and also address other algorithmic issues that arise in data exchange. In particular, we study the problem of computing the certain answers of target queries by simply evaluating them on a canonical universal solution, and we explore the boundary of what queries can and cannot be answered this way, in a data exchange setting. 1
|
1684
|
Computational Complexity
– Papadimitriou
- 1994
|
|
1066
|
Foundations of Databases
– Abiteboul, Hull, et al.
- 1995
|
|
405
|
D.: Answering queries using views
– Levy, Mendelzon, et al.
- 1995
|
|
367
|
Data integration: A theoretical perspective
– Lenzerini
- 2002
|
|
328
|
P.M.: Optimal implementation of conjunctive queries in relational data bases. STOC
– Chandra, Merlin
- 1977
|
|
290
|
Answering queries using views: A survey
– Halevy
- 2001
|
|
259
|
The complexity of satisfiability problems
– Schaefer
- 1978
|
|
228
|
Complexity of answering queries using materialized views
– Abiteboul, Duschka
- 1998
|
|
140
|
Schema Mapping as Query Discovery
– Miller, Haas, et al.
- 2000
|
|
119
|
Elements of Relational Database Theory
– Kanellakis
- 1990
|
|
116
|
Data exchange: Semantics and query answering
– Fagin, Kolaitis, et al.
- 2003
|
|
113
|
Translating Web Data
– Popa, Velegrakis, et al.
- 2002
|
|
102
|
ILOG: declarative creation and manipulation of object identifiers
– Hull, Yoshikawa
- 1990
|
|
98
|
Navigational plans for data integration
– Friedman, Levy, et al.
- 1999
|
|
95
|
The complexity of facets (and some facets of complexity
– PAPADIMITRIOU, YANNAKAKIS
- 1984
|
|
80
|
On monadic NP vs. monadic co-NP
– Fagin, Stockmeyer, et al.
- 1995
|
|
78
|
Correspondence and translation for heterogeneous data
– Abiteboul, Cluet, et al.
- 1997
|
|
68
|
Testing implications of data dependencies
– Maier, Mendelzon, et al.
- 1979
|
|
61
|
Inclusion Dependencies and Their Interaction with Functional Dependencies
– Casanova, Fagin, et al.
- 1984
|
|
59
|
A proof procedure for data dependencies
– Beeri, Vardi
- 1984
|
|
56
|
On the Foundations of the Universal Relation Model
– Maier, Ullman, et al.
- 1984
|
|
50
|
Data integration under integrity constraints
– Calì, Calvanese, et al.
- 2002
|
|
47
|
Reformulation of XML Queries and Constraints
– Deutsch, Tannen
- 2003
|
|
40
|
der Meyden. Logical Approaches to Incomplete Information: A Survey
– van
- 1998
|
|
38
|
der Meyden. The Complexity of Querying Indefinite Data about Linearly Ordered Domains
– van
- 1992
|
|
37
|
Functional and inclusion dependencies: A graph theoretic approach
– Cosmadakis, Kanellakis
- 1986
|
|
36
|
Physical data independence, constraints, and optimization with universal plans
– Deutsch, Popa, et al.
- 1999
|
|
35
|
The core of a graph
– Hell, Neˇsetˇril
- 1992
|
|
27
|
clauses and database dependencies
– Horn
- 1982
|
|
27
|
Optimal Implementation of Conjunctive Queries
– Chandra, Merlin
- 1977
|
|
26
|
Why horn formulas matter in computer science: Initial structures and generic examples
– Makowsky
- 1987
|
|
25
|
Removing redundancy from a clause
– Gottlob, Fermuller
- 1993
|
|
20
|
CONVERT: A High Level Translation Definition Language for Data Conversion
– Shu, Housel, et al.
- 1975
|
|
17
|
EXPRESS: A Data EXtraction, Processing, amd REStructuring System
– Shu, Housel, et al.
- 1977
|
|
8
|
The Complexity of Evaluating Relational Queries
– Cosmadakis
- 1983
|
|
3
|
Cores for data exchange: Hard cases and practical solutions
– Gottlob
- 2004
|
|
1
|
Multivalued Depedencies and a New Normal Form for Relational Databases
– Fagin
- 1977
|
