On preservation under homomorphisms and unions of conjunctive queries

Journal of the ACM

Volumn 53, Issue 2, 2006, Pages 208-237

  Atserias, Albert ^a   Dawar, Anuj ^b   Kolaitis, Phokion G ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Catalog; Conjunctive queries; Finite model theory; First order logic; Graph minors; Homomorphisms; Infinitary logic; Preservation

Indexed keywords

CATALOG; CONJUNCTIVE QUERIES; FINITE MODEL THEORY; FIRST-ORDER LOGIC; GRAPH MINORS; HOMOMORPHISMS; INFINITARY LOGIC; PRESERVATION;

FINITE AUTOMATA; FORMAL LOGIC; GRAPH THEORY; MATHEMATICAL MODELS; MATHEMATICAL TECHNIQUES; RELATIONAL DATABASE SYSTEMS; THEOREM PROVING;

QUERY LANGUAGES;

EID: 33745220703     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/1131342.1131344     Document Type: Article

References (37)

1. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley, Reading, MA.
2. AJTAI, M., AND GUREVICH, Y. 1987. Monotone versus positive. J. ACM 34, 1004-1015.
3. AJTAI, M., AND GUREVICH, Y. 1994. Datalog vs first-order logic. J. Comput. Syst. Sci. 49, 562-588.
4. ALECHINA, N., AND GUREVICH, Y. 1997. Syntax vs semantics on finite structures. In Structures in Logic and Computer Science, J. Mycielski, G. Rozenberg, and A. Salomaa, Eds. Lecture Notes in Computer Science, vol. 1261. Springer-Verlag, New York, 14-33.
5. ATSERIAS, A., DAWAR, A., AND GROHE, M. 2005. Preservation under extensions on well-behaved finite structures. In Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005. Lecture Notes in Computer Science, vol. 3580. Springer-Verlag, New York, 1437-1449.
6. ATSERIAS, A., DAWAR, A., AND KOLAITIS, P. G. 2004. On preservation under homomorphisms and unions of conjunctive queries. In Proceedings of the 23rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS). ACM, New York, 319-329.
7. CHANDRA, A., AND MERLIN, P. 1977. Optimal implementation of conjunctive queries in relational databases. In Proceedings of the 9th ACM Symposium on Theory of Computing. ACM, New York, 77-90.
8. COURCELLE, B., ENGELFRIET, J., AND ROZENBERG, G. 1993. Handle rewriting hypergraph grammars. J. Comput. Syst. Sci. 46, 218-270.
9. DALMAU, V., KOLAITIS, P. G., AND VARDI, M. Y. 2002. Constraint satisfaction, bounded treewidth, and finite variable logics. In Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming - CP 2002. Lecture Notes in Computer Science, vol. 2470. Springer-Verlag, New York, 310-326.
10. DECHTER, R., AND PEARL, J. 1989. Tree clustering for constraint networks. Artif. Intel. 38, 3, 353-366.
11. DIESTEL, R. 1997. Graph Theory. Springer-Verlag, New York.
12. DOWNEY, R., AND FELLOWS, M. 1999. Parametrized Complexity. Springer-Verlag, New York.
13. EPSTEIN, D. 2000. Diameter and treewidth in minor-closed graph families. Algorithmica 27, 275-291.
14. ERDÖS, P., AND RADO, R. 1960. Intersection theorems for systems of sets. J. London Math. Soc. 35, 85-90.
15. FAGIN, R., KOLAITIS, P. G., AND POPA, L. 2003. Data exchange: Getting to the core. In Proceedings of the 22nd ACM Symposium on Principles of Database Systems. ACM, New York, 90-101.
16. FEDER, T., AND VARDI, M. 2003. Homomorphism closed vs existential positive. In Proceedings of the 18th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 311-320.
17. FRICK, M., AND GROHE, M. 2000. Deciding first-order properties of locally tree-decomposable functions. J. ACM 48, 1184-2006.
18. GAIFMAN, H. 1982. On local and nonlocal properties. In Logic Colloquium '81, J. Stern, Ed. North Holland, Amsterdam, The Netherlands, 105-135.
19. GRAHAM, R. L., ROTHSCHILD, B. L., AND SPENCER, J. H. 1980. Ramsey Theory. Wiley, New York.
20. GROHE, M. 2003. The complexity of homomorphism and constraint satisfaction problems seen from the other side. In Proceedings of the 44th IEEE Symposium on Foundations of Computer Science - FOCS 2003.
21. GROHE, M., FLUM, J., AND FRICK, M. 2002. Query evaluation via tree-decompositions. J. ACM 49, 716-752.
22. GROHE, M., SCHWENTICK, T., AND SEGOUFIN, L. 2001. When is the evaluation of conjunctive queries tractable? In Proceedings of the 32nd ACM Symposium on Theory of Computing. ACM, New York, 657-666.
23. GUREVICH, Y. 1984. Toward logic tailored for computational complexity. In Computation and Proof Theory, M. Richter et al., Eds. Lecture Notes in Mathematics. Springer-Verlag, New York, 175-216.
24. GUREVICH, Y. 1990. On finite model theory. In Feasible Mathematics, S. Buss and P. Scott, Eds. Birkhäuser, 211-219.
25. HELL, P., AND NESETRIL, J. 1992. The core of a graph. Discrete Mathematics 109, 117-126.
26. HODGES, W. 1993. Model Theory. Cambridge University Press, Cambridge, UK.
27. KOLAITIS, P. G., AND VARDI, M. Y. 1995. On the expressive power of Datalog: Tools and a case study. J. Comput. Syst. Sci. 51, 110-134.
28. KOLAITIS, P. G., AND VARDI, M. Y. 2000. Conjunctive query containment and constraint satisfaction. J. Comput. Syst. Sci. 61, 302-332.
29. KREIDLER, M. 1999. Strukturinformation bei der Beschreibung monodischer NP-Problente. Shaker-Verlag, New York.
30. KREIDLER, M., AND SEESE, D. 1999. Monadic NP and graph minors. In CSL'98: Proceedings of the Annual Conference of the European Association for Computer Science Logic. Lecture Notes in Computer Science, vol. 1584. Springer-Verlag, New York, 126-141.
31. ROBERTSON, N., AND SEYMOUR, P. 1986. Graph minors. V. Excluding a planar graph. J. Combinat. Theory, Ser. B 41, 92-11.
32. ROSEN, E. 2002. Some aspects of model theory and finite strucrtures. Bull. Symb. Logic 8, 380-403.
33. ROSSMAN, B. 2005. Existential positive types and preservation under homomorphisisms. In Proceedings of the 20th IEEE Symposium on Logic in Computer Science. 467-476.
34. SAGIV, Y., AND YANNAKAKIS, M. 1981. Equivalence between relational expressions with the union and difference operators. J. ACM 27, 4, 633-655.
35. STOLBOUSHKIN, A. 1995. Finite monotone properties. In Proceedings of the 10th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 324-330.
36. TAIT, W. W. 1959. A counterexample to a conjecture of Scott and Suppes. J. Symb. Logic 24, 15-16.
37. ULLMAN, J. 1989. Bottom-up beats top-down for Datalog. In Proceedings of the 8th ACM Symposium on Principles of Database Systems. ACM, New York, 140-149.