Composing schema mappings: Second-order dependencies to the rescue

ACM Transactions on Database Systems

Volumn 30, Issue 4, 2005, Pages 994-1055

  Fagin, Ronald ^a   Kolaitis, Phokion G ^a   Popa, Lucian ^a   Tan, Wang Chiew ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Certain answers; Chase; Composition; Computational complexity; Conjunctive queries; Data exchange; Data integration; Dependencies; Metadata model management; Query answering; Schema mapping; Second order logic; Universal solution

Indexed keywords

COMPOSITION; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; METADATA; SEMANTICS; SET THEORY;

CERTAIN ANSWERS; CHASE; DATA EXCHANGE; DATA INTEGRATION; DEPENDENCIES; METADATA MODEL MANAGEMENT; QUERY ANSWERING; SCHEMA MAPPING; SECOND-ORDER LOGIC; UNIVERSAL SOLUTION;

CONFORMAL MAPPING;

EID: 33745201812     PISSN: 03625915     EISSN: 03625915     Source Type: Journal    
DOI: 10.1145/1114244.1114249     Document Type: Conference Paper

References (26)

1. ABITEBOUL, S. AND DUSCHKA, O. M. 1998. Complexity of answering queries using materialized views. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS). ACM, New York, 254-263.
2. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley, Reading, MA.
3. BEERI, C. AND VARDI, M. Y. 1984a. A proof procedure for data dependencies. J. ACM. 31, 4, 718-741.
4. BEERI, C. AND VARDI, M. Y. 1984b. Formal systems for tuple and equality generating dependencies. SIAM J. Comput. 13, 1, 76-98.
5. BERNSTEIN, P. A. 2003. Applying model management to classical meta-data problems. In Proceedings of the Conference on Innovative Data Systems Research (CIDR). 209-220.
6. CHANDRA, A. K. AND HAREL, D. 1982. Structure and complexity of relational queries. J. Comput. Syst. Sci. 25, 1, 99-128.
7. DAWAR, A. 1998. A restricted second order logic for finite structures. Inf. Comput. 143, 2, 154-174.
8. EBBINGHAUS, H.-D. AND FLUM, J. 1999. Finite Model Theory, 2nd Edition. Springer-Verlag, New York.
9. ENDERTON, H. B. 2001. A Mathematical Introduction to Logic, 2nd Edition. Academic Press, Orlando, FL.
10. FAGIN, R. 1974. Generalized first-order spectra and polynomial-time recognizable sets. In Complexity of Computation, SIAM-AMS Proceedings, Vol. 7, R. M. Karp, Ed. 43-73.
11. FAGIN, R. 1982. Horn clauses and database dependencies. J. ACM 29, 4 (Oct.), 952-985.
12. FAGIN, R., KOLAITIS, P. G., MILLER, R. J., AND POPA, L. 2005a. Data exchange: semantics and query answering. Theoret. Comput. Sci. 336, 89-124.
13. (Preliminary version in Proceedings of the 2003 International Conference on Database Theory, pp. 207-224.)
14. FAGIN, R., KOLAITIS, P. G., AND POPA, L. 2005b. Data exchange: Getting to the core. ACM Trans. Datab. Syst. 30, 1 (March), 174-210.
15. (A preliminary version appeared in Proceedings of the Symposium on Principles of Database Systems (PODS 2003). ACM New York, 90-101).
16. FAGIN, R., KOLAITIS, P. G., POPA, L., AND TAN, W.-C. 2004. Composing schema mappings: Second-order dependencies to the rescue. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS). ACM, New York, 83-94.
17. FEDER, T. AND VARDI, M. 1998. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM J. Comput. 28, 57-104.
18. (Preliminary version in Proc. 25th ACM Symp. on Theory of Computing, May 1993, pp. 612-622.)
19. GAREY, M., JOHNSON, D. S., AND STOCKMEYER, L. J. 1976. Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1, 237-267.
20. HALEVY, A. Y., IVES, Z. G., MORK, P., AND TATARINOV, I. 2003. Piazza: Data management infrastructure for semantic web applications. In Proceedings of the International World Wide Web Conference. 556-567.
21. IMMERMAN, N. 1999. Descriptive Complexity. Springer-Verlag, New York.
22. LENZERINI, M. 2002. Data integration: A theoretical perspective. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS). ACM, New York, 233-246.
23. MADHAVAN, J. AND HALEVY, A. Y. 2003. Composing mappings among data sources. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 572-583.
24. MILLER, R. J., HAAS, L. M., AND HERNÁNDEZ, M. 2000. Schema mapping as query discovery. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 77-88.
25. POPA, L., VELEGHAKIS, Y., MILLER, R. J., HERNANDEZ, M. A., AND FAGIN, R. 2002. Translating web data. In Proceedings of the International Conference on Very Large Data Bases (VLDB). 598-609.
26. VASSILIADIS, P., SIMITSIS, A., AND SKIADOPOULOS, S. 2002. On the logical modeling of ETL processes. In Proceedings of the International Conference on Advanced Information Systems Engineering (CAiSE). 782-786.