article

Data exchange: semantics and query answering

Authors:

Phokion G. Kolaitis,

Renée J. Miller,

Lucian PopaAuthors Info & Claims

Theoretical Computer Science, Volume 336, Issue 1

Pages 89 - 124

Published: 25 May 2005 Publication History

Abstract

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. We show that a universal solution has no more and no less data than required for data exchange and that it represents the entire space of possible solutions. We then identify fairly general, yet 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 the "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.

References

[1]

{1} S. Abiteboul, O.M. Duschka, Complexity of answering queries using materialized views, in: Proc. of the ACM Symp. on Principles of Database Systems (PODS), 1998, pp. 254-263.

Digital Library

[2]

{2} S. Abiteboul, O.M. Duschka, Complexity of answering queries using materialized views, 2000 (unpublished full version of {1}).

[3]

{3} S. Abiteboul, S. Cluet, T. Milo, Correspondence and translation for heterogeneous data, in: Proc. of the Internat. Conf. on Database Theory (ICDT), 1997, pp. 351-363.

Digital Library

[4]

{4} M. Arenas, P. Barceló, R. Fagin, L. Libkin, Locally consistent transformations and query answering in data exchange, in: Proc. of the ACM Symp. on Principles of Database Systems (PODS), 2004, pp. 229-240.

Digital Library

[5]

{5} C. Beeri, M.Y. Vardi, A proof procedure for data dependencies, J. Assoc. Comput. Mach. 31 (4) (1984) 718-741.

Digital Library

[6]

{6} A. Calì, D. Calvanese, G. De Giacomo, M. Lenzerini, Data integration under integrity constraints, in: Proc. of the Internat. Conf. on Advanced Information Systems Engineering (CAiSE), 2002, pp. 262-279.

Digital Library

[7]

{7} M.A. Casanova, R. Fagin, C.H. Papadimitriou, Inclusion dependencies and their interaction with functional dependencies, J. Comput. System Sci. 28 (1) (1984) 29-59.

[8]

{8} A.K. Chandra, P.M. Merlin, Optimal implementation of conjunctive queries in relational data bases, in: Proc. of the ACM Symp. on Theory of Computing (STOC), 1977, pp. 77-90.

Digital Library

[9]

{9} S.S. Cosmadakis, P.C. Kanellakis, Functional and inclusion dependencies: a graph theoretic approach, in: P.C. Kanellakis, F.P. Preparata (Eds.), Advances in Computing Research, Vol. 3, 1986, pp. 163-184.

[10]

{10} A. Deutsch, V. Tannen, Optimization properties of conjunctive regular path queries, in: Internat. Workshop on Database Programming Languages, 2001, pp. 21-39.

Digital Library

[11]

{11} A. Deutsch, V. Tannen, Reformulation of XML queries and constraints, in: Proc. of the Internat. Conf. on Database Theory (ICDT), 2003, pp. 225-241.

Digital Library

[12]

{12} O.M. Duschka, M.R. Genesereth, A.Y. Levy, Recursive query plans for data integration, J. Logic Programming 43 (1) (2000) 49-73.

[13]

{13} R. Fagin, Horn clauses and database dependencies, J. Assoc. Comput. Mach. 29 (4) (1982) 952-985.

Digital Library

[14]

{14} R. Fagin, L. Stockmeyer, M.Y. Vardi, On monadic NP vs. monadic co-NP Inform. Comput. 120 (1) (1995) 78-92.

Digital Library

[15]

{15} R. Fagin, Ph.G. Kolaitis, R.J. Miller, L. Popa, Data exchange: semantics and query answering, in: Proc. of the Internat. Conf. on Database Theory (ICDT), 2003, pp. 207-224.

Digital Library

[16]

{16} R. Fagin, Ph.G. Kolaitis, L. Popa, Data exchange: getting to the core, in: Proc. of the ACM Symp. on Principles of Database Systems (PODS), 2003, pp. 90-101.

Digital Library

[17]

{17} M. Friedman, A.Y. Levy, T.D. Millstein, Navigational plans for data integration, in: Proc. of the National Conf. on Artificial Intelligence (AAAI), 1999, pp. 67-73.

Digital Library

[18]

{18} A. Halevy, Answering queries using views: a survey, VLDB J. (2001) 270-294.

Digital Library

[19]

{19} P. Hell, J. Nešetřil, The core of a graph, Discrete Math. 109 (1992) 117-126.

Digital Library

[20]

{20} R. Hull, M. Yoshikawa, ILOG: declarative creation and manipulation of object identifiers, in: Proc. of the Internat. Conf. on Very Large Data Bases (VLDB), 1990, pp. 455-468.

Digital Library

[21]

{21} M. Lenzefini, Data integration: a theoretical perspective, in: Proc. of the ACM Symp. on Principles of Database Systems (PODS), 2002, pp. 233-246.

Digital Library

[22]

{22} A.Y. Levy, A.O. Mendelzon, Y. Sagiv, D. Srivastava, Answering queries using views, in: Proc. of the ACM Symp. on Principles of Database Systems (PODS), May 1995, pp. 95-104.

Digital Library

[23]

{23} D. Maier, A.O. Mendelzon, Y. Sagiv, Testing implications of data dependencies, ACM Trans. Database Systems 4 (4) (1979) 455-469.

Digital Library

[24]

{24} D. Maier, J.D. Ullman, M.Y. Vardi, On the foundations of the universal relation model, ACM Trans. Database Systems 9 (2) (1984) 283-308.

Digital Library

[25]

{25} J.A. Makowsky, Why Horn formulas matter in computer science: initial structures and generic examples, J. Comput. System Sci. 34 (2/3) (1987) 266-292.

Digital Library

[26]

{26} R.J. Miller, L.M. Haas, M. Hernández, Schema mapping as query discovery, in: Proc. of the Internat. Conf. on Very Large Data Bases (VLDB), 2000, pp. 77-88.

Digital Library

[27]

{27} L. Popa, Y. Velegrakis, R.J. Miller, M.A. Hernandez, R. Fagin, Translating web data, in: Proc. of the Internat. Conf. on Very Large Data Bases (VLDB), 2002, pp. 598-609.

Digital Library

[28]

{28} T.J. Schaefer, The complexity of satisfiability problems, in: Proc. of the ACM Symp. on Theory of Computing (STOC), 1978, pp. 216-226.

Digital Library

[29]

{29} N.C. Shu, B.C. Housel, V.Y. Lum, CONVERT: a high level translation definition language for data conversion, Comm. ACM 18 (10) (1975) 557-567.

Digital Library

[30]

{30} N.C. Shu, B.C. Housel, R.W. Taylor, S.P. Ghosh, V.Y. Lum, EXPRESS: a data extraction, processing, and restructuring system, ACM Trans. Database Systems 2 (2) (1977) 134-174.

Digital Library

[31]

{31} R. van der Meyden, The complexity of querying indefinite data about linearly ordered domains, J. Comput. System Sci. 54 (1997) 113-135.

Digital Library

[32]

{32} R. van der Meyden, Logical approaches to incomplete information: a survey, in: J. Chomicki, G. Saake (Eds.), Logics for Databases and Information Systems, Kluwer, Dordrecht, 1998, pp. 307-356.

Digital Library

[33]

{33} M.Y. Vardi, The complexity of relational query languages, in: Proc. of the ACM Symp. on Theory of Computing (STOC), 1982, pp. 137-146.

Digital Library

Cited By

Lanzinger MNissl MSallinger EWałęga PElkind E(2023)Temporal datalog with existential quantificationProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/365(3277-3285)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/365
Psallidas FAgrawal ASugunan CIbrahim KKaranasos KCamacho-Rodríguez JFloratou ACurino CRamakrishnan R(2023)OneProvenance: Efficient Extraction of Dynamic Coarse-Grained Provenance from Database Query Event LogsProceedings of the VLDB Endowment10.14778/3611540.361155516:12(3662-3675)Online publication date: 1-Aug-2023
https://dl.acm.org/doi/10.14778/3611540.3611555
Calautti MMilani MPieris A(2023)Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental StudyProceedings of the VLDB Endowment10.14778/3611479.361149316:11(2858-2870)Online publication date: 24-Aug-2023
https://dl.acm.org/doi/10.14778/3611479.3611493
Show More Cited By

Index Terms

Data exchange: semantics and query answering

Recommendations

Data exchange: getting to the core
Special Issue: SIGMOD/PODS 2003

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. Given a source instance, there may be many solutions to the data exchange ...
Data exchange: computing cores in polynomial time
PODS '06: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, namely, computing the core of a universal solution to a data exchange ...
Solutions and query rewriting in data exchange

Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema. Given a source instance, there may be many solutions - target instances that satisfy the constraints of the data exchange problem. ...

Comments

Information & Contributors

Information

Published In

cover image Theoretical Computer Science

Theoretical Computer Science Volume 336, Issue 1

Database theory

25 May 2005

199 pages

ISSN:0304-3975

Issue’s Table of Contents

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 25 May 2005

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

352
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lanzinger MNissl MSallinger EWałęga PElkind E(2023)Temporal datalog with existential quantificationProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/365(3277-3285)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/365
Psallidas FAgrawal ASugunan CIbrahim KKaranasos KCamacho-Rodríguez JFloratou ACurino CRamakrishnan R(2023)OneProvenance: Efficient Extraction of Dynamic Coarse-Grained Provenance from Database Query Event LogsProceedings of the VLDB Endowment10.14778/3611540.361155516:12(3662-3675)Online publication date: 1-Aug-2023
https://dl.acm.org/doi/10.14778/3611540.3611555
Calautti MMilani MPieris A(2023)Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental StudyProceedings of the VLDB Endowment10.14778/3611479.361149316:11(2858-2870)Online publication date: 24-Aug-2023
https://dl.acm.org/doi/10.14778/3611479.3611493
Rodriguez OUlliana FMugnier M(2023)Scalable Reasoning on Document Stores via Instance-Aware Query RewritingProceedings of the VLDB Endowment10.14778/3611479.361148116:11(2699-2713)Online publication date: 24-Aug-2023
https://dl.acm.org/doi/10.14778/3611479.3611481
Baget JMugnier MRudolph SGeerts FNgo HSintos S(2023)Bounded Treewidth and the Infinite Core Chase: Complications and Workarounds toward Decidable QueryingProceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3584372.3588659(291-302)Online publication date: 18-Jun-2023
https://dl.acm.org/doi/10.1145/3584372.3588659
Bellomarini LBenedetto DBrandetti MSallinger E(2022)Exploiting the Power of Equality-Generating Dependencies in Ontological ReasoningProceedings of the VLDB Endowment10.14778/3565838.356585015:13(3976-3988)Online publication date: 1-Sep-2022
https://dl.acm.org/doi/10.14778/3565838.3565850
Benedikt MBuron MGermano SKappelmann KMotik B(2022)Rewriting the infinite chaseProceedings of the VLDB Endowment10.14778/3551793.355185115:11(3045-3057)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.14778/3551793.3551851
Toussaint EGuagliardo PLibkin LSequeda J(2022)Troubles with nulls, views from the usersProceedings of the VLDB Endowment10.14778/3551793.355181815:11(2613-2625)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.14778/3551793.3551818
Alhazmi ABlount TKonstantinidis G(2022)ForBackBenchProceedings of the VLDB Endowment10.14778/3529337.352933815:8(1519-1532)Online publication date: 22-Jun-2022
https://dl.acm.org/doi/10.14778/3529337.3529338
Hannula MWijsen JLibkin LBarceló P(2022)A Dichotomy in Consistent Query Answering for Primary Keys and Unary Foreign KeysProceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3517804.3524157(437-449)Online publication date: 12-Jun-2022
https://dl.acm.org/doi/10.1145/3517804.3524157
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents