Static analysis of schema-mappings ensuring oblivious termination

ACM International Conference Proceeding Series

Volumn , Issue , 2010, Pages 183-195

  Marnette, Bruno ^a   Geerts, Floris ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

data exchange; data integration; determinacy; relative completeness; schema mapping

Indexed keywords

BASIC OPERATION; COMPLEXITY BOUNDS; DATA EXCHANGE; DATA INTEGRATION; DECISION PROCEDURE; DISJUNCTIVE CONSTRAINTS; EFFICIENT COMPUTATION; EQUALITY CONSTRAINTS; HIGH LEVEL SPECIFICATION; IMPLICATION PROBLEM; INCLUSION DEPENDENCIES; KEY CONSTRAINTS; LOWER AND UPPER BOUNDS; RELATIVE INFORMATION; SCHEMA MAPPINGS; SOURCE DEPENDENCY; STANDARD CONSTRAINTS; TERMINATION CONDITION; UNIVERSAL SOLUTIONS;

COMPUTABILITY AND DECIDABILITY; DATA HANDLING; DATABASE SYSTEMS; SEMANTICS; STANDARDS; TARGETS; XML;

MAPPING;

EID: 77954489461     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1804669.1804694     Document Type: Conference Paper

References (23)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. 1995.
2. A. Calì, G. Gottlob, and T. Lukasiewicz. A general datalog-based framework for tractable query answering over ontologies. In PODS, pages 77-86, 2009.
3. S. Chaudhuri and M. Y. Vardi. On the equivalence of recursive and nonrecursive datalog programs. J. Comput. Syst. Sci., 54(1):61-78, 1997.
4. A. Deutsch, A. Nash, and J. B. Remmel. The chase revisited. In PODS, pages 149-158, 2008.
5. A. Deutsch and V. Tannen. Xml queries and constraints, containment and reformulation. Theor. Comput. Sci., 336(1):57-87, 2005.
6. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: semantics and query answering. Theor. Comput. Sci., 336(1):89-124, 2005. (Pubitemid 40612385)
7. R. Fagin, P. G. Kolaitis, and L. Popa. Data exchange: getting to the core. ACM Trans. Database Syst., 30(1):174-210, 2005.
8. W. Fan and F. Geerts. Relative information completeness. In PODS, pages 97-106, 2009.
9. A. Fuxman, P. G. Kolaitis, R. J. Miller, and W. C. Tan. Peer data exchange. ACM Trans. Database Syst., 31(4):1454-1498, 2006.
10. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci., 64(3):579-627, 2002.
11. G. Gottlob and A. Nash. Efficient core computation in data exchange. J. ACM, 55(2), 2008.
12. L. M. Haas, M. A. Hernández, H. Ho, L. Popa, and M. Roth. Clio grows up: from research prototype to industrial tool. In SIGMOD, pages 805-810, 2005.
13. A. Hernich and N. Schweikardt. Cwa-solutions for data exchange settings with target dependencies. In PODS, pages 113-122, 2007.
14. P. G. Kolaitis. Schema mappings, data exchange, and metadata management. In PODS, pages 61-75, 2005.
15. L. Libkin. Data exchange and incomplete information. In PODS, pages 60-69, 2006.
16. L. Libkin and C. Sirangelo. Data exchange and schema mappings in open and closed worlds. In PODS, pages 139-148, 2008.
17. B. Marnette. Generalized schema-mappings: from termination to tractability. In PODS, pages 13-22, 2009.
18. M. Meier, M. Schmidt, and G. Lausen. On chase termination beyond stratification. PVLDB, 2(1):970-981, 2009.
19. A. Nash, L. Segoufin, and V. Vianu. Determinacy and rewriting of conjunctive queries using views: A progress report. In ICDT, pages 59-73, 2007.
20. Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and difference operators. J. ACM, 27(4):633-655, 1980.
21. L. Segoufin and V. Vianu. Views and queries: determinacy and rewriting. In PODS, pages 49-60, 2005.
22. O. Shmueli. Equivalence of datalog queries is undecidable. J. Log. Program., 15(3):231-241, 1993.
23. B. ten Cate, L. Chiticariu, P. G. Kolaitis, and W. C. Tan. Laconic schema mappings: Computing the core with sql queries. PVLDB, 2(1):1006-1017, 2009.