Relaxed Notions of Schema Mapping Equivalence Revisited

Theory of Computing Systems

Volumn 52, Issue 3, 2013, Pages 483-541

  Pichler, Reinhard ^a   Sallinger, Emanuel ^a   Savenkov, Vadim ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Data integration; Equivalence of schema mappings; Schema mapping optimization

Indexed keywords

DATA INTEGRATION; ELECTRONIC DATA INTERCHANGE;

CONJUNCTIVE QUERIES; INCLUSION DEPENDENCIES; LOGICAL EQUIVALENCE; OPTIMIZATION TASK; SCHEMA MAPPINGS;

EQUIVALENCE CLASSES;

EID: 84874816529     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-012-9397-0     Document Type: Article

References (33)

1. Arenas, M., Fagin, R., Nash, A.: Composition with target constraints. In: Proc. ICDT'10. ACM International Conference Proceeding Series, pp. 129-142. ACM, New York (2010).
2. Arenas, M., Pérez, J., Reutter, J. L., Riveros, C.: Inverting schema mappings: bridging the gap between theory and practice. PVLDB 2(1), 1018-1029 (2009).
3. Arenas, M., Pérez, J., Reutter, J. L., Riveros, C.: Foundations of schema mapping management. In: Proc. PODS, pp. 227-238. ACM, New York (2010).
4. Arenas, M., Pérez, J., Riveros, C.: The recovery of a schema mapping: bringing exchanged data back. ACM Trans. Database Syst. 34(4) (2009).
5. Beeri, C., Vardi, M. Y.: A proof procedure for data dependencies. J. ACM 31(4), 718-741 (1984).
6. Bernstein, P. A.: Applying model management to classical meta data problems. In: Proc. CIDR'03 (2003). Available from http://www-db. cs. wisc. edu/cidr/cidr2003/program/p19. pdf.
7. Bernstein, P. A., Green, T. J., Melnik, S., Nash, A.: Implementing mapping composition. VLDB J. 17(2), 333-353 (2008).
8. Bernstein, P. A., Melnik, S.: Model management 2. 0: manipulating richer mappings. In: Proc. SIGMOD'07, pp. 1-12. ACM, New York (2007).
9. Deutsch, A., Nash, A., Remmel, J. B.: The chase revisited. In: Proc. PODS'08, pp. 149-158. ACM, New York (2008).
10. Deutsch, A., Tannen, V.: Xml queries and constraints, containment and reformulation. Theor. Comput. Sci. 336(1), 57-87 (2005).
11. Duschka, O. M., Genesereth, M. R., Levy, A. Y.: Recursive query plans for data integration. J. Log. Program. 43(1), 49-73 (2000).
12. Fagin, R.: Horn clauses and database dependencies. J. ACM 29(4), 952-985 (1982).
13. Fagin, R.: Inverting schema mappings. ACM Trans. Database Syst. 32(4) (2007).
14. Fagin, R., Kolaitis, P. G., Miller, R. J., Popa, L.: Data exchange: semantics and query answering. Theor. Comput. Sci. 336(1), 89-124 (2005).
15. Fagin, R., Kolaitis, P. G., Nash, A., Popa, L.: Towards a theory of schema-mapping optimization. In: Proc. PODS'08, pp. 33-42. ACM, New York (2008).
16. Fagin, R., Kolaitis, P. G., Popa, L.: Data exchange: getting to the core. ACM Trans. Database Syst. 30(1), 174-210 (2005).
17. Fagin, R., Kolaitis, P. G., Popa, L., Tan, W. C.: Composing schema mappings: Second-order dependencies to the rescue. ACM Trans. Database Syst. 30(4), 994-1055 (2005).
18. Fagin, R., Kolaitis, P. G., Popa, L., Tan, W. C.: Quasi-inverses of schema mappings. ACM Trans. Database Syst. 33(2) (2008).
19. Fagin, R., Kolaitis, P. G., Popa, L., Tan, W. C.: Reverse data exchange: coping with nulls. In: Proc. PODS'09, pp. 23-32. ACM, New York (2009).
20. Gottlob, G., Papadimitriou, C. H.: On the complexity of single-rule datalog queries. Inf. Comput. 183(1), 104-122 (2003).
21. Gottlob, G., Pichler, R., Savenkov, V.: Normalization and optimization of schema mappings. PVLDB 2(1), 1102-1113 (2009).
22. Halevy, A. Y., Rajaraman, A., Ordille, J. J.: Data integration: the teenage years. In: Proc. VLDB'06, pp. 9-16. ACM, New York (2006).
23. Johnson, D. S., Klug, A. C.: Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28(1), 167-189 (1984).
24. Kolaitis, P. G.: Schema mappings, data exchange, and metadata management. In: Proc. PODS'05, pp. 61-75. ACM, New York (2005).
25. Lenzerini, M.: Data integration: a theoretical perspective. In: Proc. PODS'02, pp. 233-246. ACM, New York (2002).
26. Madhavan, J., Halevy, A. Y.: Composing mappings among data sources. In: Proc. VLDB'03, pp. 572-583 (2003).
27. Marnette, B.: Generalized schema-mappings: from termination to tractability. In: PODS, pp. 13-22 (2009).
28. Meier, M., Schmidt, M., Lausen, G.: On chase termination beyond stratification. PVLDB 2(1), 970-981 (2009).
29. Melnik, S.: Generic Model Management: Concepts and Algorithms. Lecture Notes in Computer Science, vol. 2967. Springer, Berlin (2004).
30. Nash, A., Bernstein, P. A., Melnik, S.: Composition of mappings given by embedded dependencies. ACM Trans. Database Syst. 32(1), 4 (2007).
31. Shmueli, O.: Equivalence of datalog queries is undecidable. J. Log. Program. 15(3), 231-241 (1993).
32. Pichler, R., Savenkov, V.: Towards practical feasibility of core computation in data exchange. Theor. Comput. Sci. 411(7-9), 935-957 2010.
33. Feinerer, I., Pichler, R., Sallinger, E., Savenkov, V.: On the undecidability of the equivalence of second-order tuple generating dependencies. In: AMW (2011). http://ceur-ws. org/Vol-749/paper5. pdf.