Data exchange: Computing cores in polynomial time

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2006, Pages 40-49

  Gottlob, Georg ^a   Nash, Alan ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Chase; Complexity; Conjunctive queries; Constraints; Core; Data exchange; Data integration; Dependencies; Query evaluation; Tractability; Universal solutions

Indexed keywords

CORE COMPLEXITY; EQUATION GENERATING DEPENDENCIES (EGDS); POLYNOMIAL TIME; QUERY EVALUATION; SOURCE-TO-TARGET CONSTRAINTS; TUPLE GENERATING DEPENDENCIES (TGDS); UNIVERSAL SOLUTIONS;

COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; PROBLEM SOLVING; SCHEMATIC DIAGRAMS;

ELECTRONIC DATA INTERCHANGE;

EID: 33947309918     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1142351.1142358     Document Type: Conference Paper

References (17)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison Wesley, 1995.
2. Aho, Beeri, and Ullman. The theory of joins in relational databases. ACM TODS, 4(3):297-314, 1979.
3. Beeri and Vardi. A proof procedure for data dependencies. JACM, 1984.
4. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In ACM STOC, pages 77-90, 1977.
5. A. Deutsch and V. Tannen. Reformulation of XML Queries and Constraints. In ICDT, 2003.
6. R. Fagin. Horn clauses and database dependencies. J. ACM, 29(4):952-985, 1982.
7. R. Fagin. Extending the core greedy algorithm to allow target tgds with singleton left-hand sides. 2005. Unpubl. Manuscript, 2005.
8. R. Fagin, P. O. Kolaitis, R. J. Miller, and L. Popa. Data Exchange: Semantics and Query Answering. In ICDT, 2003.
9. full version in: Theor. Comput. Sci. 336(1): 89-124 (2005).
10. R. Fagin, P. O. Kolaitis, and L. Popa. Data Exchange: Getting to the Core. In ACM PODS, pages 90-101, 2003.
11. "Full version in ACM TODS, 30(1): 147-210(2005)".
12. O. Gottlob. Computing cores for data exchange: New algoritms and practical solutions. In PODS, 2005. Extended version of the present paper. Currently available at: www.dbai.tuwien.ac.at/staff/gottlob/extcore.pdf.
13. O. Gottlob and C. G. Fermüller. Removing redundancy from a clause. Artif. Intell., 61(2):263-289, 1993.
14. O. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. JCSS, 64(3):579-627, 2002.
15. P. Hell and J. Nešetřil. The core of a graph. Discr. Math., 109(1-3):117-126, 1992.
16. P. Kolaitis. Schema mappings, data exchange and metadata management. In PODS, 2005.
17. Maier, Mendelzon, and Sagiv. Testing implication of data dependencies. ACM TODS, 1979.