Query Languages for Data Exchange: Beyond Unions of Conjunctive Queries

Theory of Computing Systems

Volumn 49, Issue 2, 2011, Pages 489-564

  Arenas, Marcelo ^a   Barceló, Pablo ^b   Reutter, Juan ^c  

^a PONTIFICIA UNIVERSIDAD CATÓLICA DE CHILE   (Chile)

^b UNIVERSITY OF CHILE   (Chile)

^c UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Certain answers; Combined complexity; Data exchange; Datalog; Query languages

Indexed keywords

EID: 79958003562     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-010-9259-6     Document Type: Article

References (22)

1. Abiteboul, S., Duschka, O.: Answering queries using materialized views. Gemo report 383.
2. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995).
3. Afrati, F. N., Li, C., Pavlaki, V.: Data exchange in the presence of arithmetic comparisons. In: Proceedings of the 11th International Conference on Extending Database Technology (EDBT), pp. 487-498 (2008).
4. Arenas, M., Barceló, P., Fagin, R., Libkin, L.: Locally consistent transformations and query answering in data exchange. In: Proceedings of the 23rd ACM Symposium on Principles of Database Systems (PODS), pp. 229-240 (2004).
5. Beeri, C., Vardi, M. Y.: A proof procedure for data dependencies. J. ACM 31(4), 718-741 (1984).
6. Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Springer, Berlin (2001).
7. Deutsch, A., Nash, A., Remmel, J. B.: The chase revisited. In: Proceedings of the 27th ACM Symposium on Principles of Database Systems (PODS), pp. 149-158 (2008)
8. Fagin, R., Kolaitis, P., Popa, L., Tan, W. C.: Composing schema mappings: Second-order dependencies to the rescue. In: Proceedings of the 23rd ACM Symposium on Principles of Database Systems (PODS), pp. 83-94 (2004).
9. Fagin, R., Kolaitis, P. G., Miller, R. J., Popa, L.: Data exchange: semantics and query answering. Theor. Comput. Sci. 336(1), 89-124 (2005).
10. Fagin, R., Kolaitis, P. G., Popa, L.: Data exchange: getting to the core. ACM Trans. Database Syst. 30(1), 174-210 (2005).
11. Gottlob, G., Papadimitriou, C.: On the complexity of single-rule datalog queries. Inf. Comput. 183(1), 104-122 (2003).
12. Greenlaw, R., Hoover, H. J., Ruzzo, W. L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, London (1995).
13. Kolaitis, P.: Schema mappings, data exchange, and metadata management. In: Proceedings of the 24th ACM Symposium on Principles of Database Systems (PODS), pp. 61-75 (2005).
14. Kolaitis, P., Panttaja, J., Tan, W.-C.: The complexity of data exchange. In: Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), pp. 30-39 (2006).
15. Imielinski, T., Lipski, W.: Incomplete information in relational databases. J. ACM 31, 761-791 (1984).
16. Lenzerini, M.: Data integration: A theoretical perspective. In: Proceedings of the 21st ACM Symposium on Principles of Database Systems (PODS), pp. 233-246 (2002).
17. Libkin, L.: Elements of Finite Model Theory. Springer, Berlin (2004).
18. Libkin, L.: Data exchange and incomplete information. In: Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS), pp. 60-69 (2006).
19. Libkin, L., Sirangelo, C.: Data exchange and schema mappings in open and closed worlds. In: Proceedings of the 27th ACM Symposium on Principles of Database Systems (PODS), pp. 139-148 (2008).
20. Ma̧dry, A.: Data exchange: On the complexity of answering queries with inequalities. Inf. Process. Lett. 94(6), 253-257 (2005).
21. Papadimitriou, C. H.: Computational Complexity. Addison Wesley, Reading (1994).
22. Vardi, M. Y.: The complexity of relational query languages. In: Proceedings of the 14th ACM Symposium on Theory of Computing (STOC), pp. 137-146 (1982).