Data exchange: Semantics and query answering

Theoretical Computer Science

Volumn 336, Issue 1, 2005, Pages 89-124

  Fagin, Ronald ^a   Kolaitis, Phokion G ^b   Miller, Renée J ^c   Popa, Lucian ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF TORONTO   (Canada)

Author keywords

Certain answers; Chase; Computational complexity; Data exchange; Data integration; Dependencies; First order inexpressibility; Query answering; Universal solution

Indexed keywords

CERTAIN ANSWERS; CHASE; DATA EXCHANGE; DATA INTEGRATION; DEPENDENCIES; FIRST-ORDER INEXPRESSIBILITY; QUERY ANSWERING; UNIVERSAL SOLUTION;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA REDUCTION; DATA STRUCTURES; HIERARCHICAL SYSTEMS; QUERY LANGUAGES; RELATIONAL DATABASE SYSTEMS; SEMANTICS;

DATA TRANSFER;

EID: 18144386595     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.10.033     Document Type: Conference Paper

References (33)

1. S. Abiteboul, and O.M. Duschka Complexity of answering queries using materialized views Proc. of the ACM Symp. on Principles of Database Systems (PODS) 1998 254 263
2. S. Abiteboul, O.M. Duschka, Complexity of answering queries using materialized views, 2000 (unpublished full version of [1]).
3. S. Abiteboul, S. Cluet, and T. Milo Correspondence and translation for heterogeneous data Proc. of the Internat. Conf. on Database Theory (ICDT) 1997 351 363
4. M. Arenas, P. Barceló, R. Fagin, and L. Libkin Locally consistent transformations and query answering in data exchange Proc. of the ACM Symp. on Principles of Database Systems (PODS) 2004 229 240
5. C. Beeri, and M.Y. Vardi A proof procedure for data dependencies J. Assoc. Comput. Mach. 31 4 1984 718 741
6. A. Calì, D. Calvanese, G. De Giacomo, and M. Lenzerini Data integration under integrity constraints Proc. of the Internat. Conf. on Advanced Information Systems Engineering (CAiSE) 2002 262 279
7. M.A. Casanova, R. Fagin, and C.H. Papadimitriou Inclusion dependencies and their interaction with functional dependencies J. Comput. System Sci. 28 1 1984 29 59
8. A.K. Chandra, and P.M. Merlin Optimal implementation of conjunctive queries in relational data bases Proc. of the ACM Symp. on Theory of Computing (STOC) 1977 77 90
9. S.S. Cosmadakis, and P.C. Kanellakis Functional and inclusion dependencies a graph theoretic approach P.C. Kanellakis F.P. Preparata Advances in Computing Research Vol. 3 1986 163 184
10. A. Deutsch, and V. Tannen Optimization properties of conjunctive regular path queries Internat. Workshop on Database Programming Languages 2001 21 39
11. A. Deutsch, and V. Tannen Reformulation of XML queries and constraints Proc. of the Internat. Conf. on Database Theory (ICDT) 2003 225 241
12. O.M. Duschka, M.R. Genesereth, and A.Y. Levy Recursive query plans for data integration J. Logic Programming 43 1 2000 49 73
13. R. Fagin Horn clauses and database dependencies J. Assoc. Comput. Mach. 29 4 1982 952 985
14. R. Fagin, L. Stockmeyer, and M.Y. Vardi On monadic NP vs. monadic co-NP Inform. Comput. 120 1 1995 78 92
15. R. Fagin, Ph.G. Kolaitis, R.J. Miller, and L. Popa Data exchange semantics and query answering Proc. of the Internat. Conf. on Database Theory (ICDT) 2003 207 224
16. R. Fagin, Ph.G. Kolaitis, and L. Popa Data exchange getting to the core Proc. of the ACM Symp. on Principles of Database Systems (PODS) 2003 90 101
17. M. Friedman, A.Y. Levy, and T.D. Millstein Navigational plans for data integration Proc. of the National Conf. on Artificial Intelligence (AAAI) 1999 67 73
18. A. Halevy, Answering queries using views: a survey, VLDB J. (2001) 270-294.
19. P. Hell, and J. Nešetřil The core of a graph Discrete Math. 109 1992 117 126
20. R. Hull, and M. Yoshikawa ILOG declarative creation and manipulation of object identifiers Proc. of the Internat. Conf. on Very Large Data Bases (VLDB) 1990 455 468
21. M. Lenzerini Data integration a theoretical perspective Proc. of the ACM Symp. on Principles of Database Systems (PODS) 2002 233 246
22. A.Y. Levy, A.O. Mendelzon, Y. Sagiv, and D. Srivastava Answering queries using views Proc. of the ACM Symp. on Principles of Database Systems (PODS) May 1995 95 104
23. D. Maier, A.O. Mendelzon, and Y. Sagiv Testing implications of data dependencies ACM Trans. Database Systems 4 4 1979 455 469
24. D. Maier, J.D. Ullman, and M.Y. Vardi On the foundations of the universal relation model ACM Trans. Database Systems 9 2 1984 283 308
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
26. R.J. Miller, L.M. Haas, and M. Hernández Schema mapping as query discovery Proc. of the Internat. Conf. on Very Large Data Bases (VLDB) 2000 77 88
27. L. Popa, Y. Velegrakis, R.J. Miller, M.A. Hernandez, and R. Fagin Translating web data Proc. of the Internat. Conf. on Very Large Data Bases (VLDB) 2002 598 609
28. T.J. Schaefer The complexity of satisfiability problems Proc. of the ACM Symp. on Theory of Computing (STOC) 1978 216 226
29. N.C. Shu, B.C. Housel, and V.Y. Lum CONVERT a high level translation definition language for data conversion Comm. ACM 18 10 1975 557 567
30. N.C. Shu, B.C. Housel, R.W. Taylor, S.P. Ghosh, and V.Y. Lum EXPRESS a data extraction, processing, and restructuring system ACM Trans. Database Systems 2 2 1977 134 174
31. R. van der Meyden The complexity of querying indefinite data about linearly ordered domains J. Comput. System Sci. 54 1997 113 135
32. R. van der Meyden Logical approaches to incomplete information a survey J. Chomicki G. Saake Logics for Databases and Information Systems 1998 Kluwer Dordrecht 307 356
33. M.Y. Vardi The complexity of relational query languages Proc. of the ACM Symp. on Theory of Computing (STOC) 1982 137 146