On preservation under homomorphisms and unions of conjunctive queries

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn 23, Issue , 2004, Pages 319-329

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

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^c University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; DATA STRUCTURES; DATABASE SYSTEMS; FORMAL LOGIC; SET THEORY; THEOREM PROVING;

CONJUNCTIVE QUERIES; FINITE STRUCTURES; HOMOMORPHISMS;

QUERY LANGUAGES;

EID: 3142766017     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1055558.1055602     Document Type: Conference Paper

References (33)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. M. Ajtai and Y. Gurevich, Monotone versus positive. Journal of the ACM, 34:1004-1015, 1987.
3. M. Ajtai and Y. Gurevich. Datalog vs first-order logic. J. of Computer and System Sciences, 49:562-588, 1994.
4. N Alechina and Y. Gurevich. Syntax vs semantics on finite structures. In J. Mycielski, G. Rozenberg, and A Salomaa, editors, Structures in Logic and Computer Science, volume 1261 of LNCS, pages 14-33. Springer, 1997.
5. A.K. Chandra and P.M. Merlin. Optimal implementation of conjunctive queries in relational databases. In Proc. 9th ACM Symp. on Theory of Computing, pages 77-90, 1977.
6. B. Courcelle, J. Engelfriet, and G. Rozenberg. Handle rewriting hypergraph grammars. Journal of Computer and System Sciences, 46:218-270, 1993.
7. V. Dalmau, Ph. G. Kolaiti and M. Y. Vardi, Constraint satisfaction, bounded treewidth, and finite variable logics. In 8th International Conference on Principles and Practice of Constraint Programming CP 2002, volume 2470 of Lecture Notes in Computer Science, pages 310-326. Springer, 2002.
8. R. Dechter and J. Pearl. Tree clustering for constraint networks. Artificial Intelligence, pages 353-366, 1989.
9. R. Diestel. Graph Theory. Springer, 1997.
10. R.G. Downey and M.R. Fellows. Parametrized Complexity. Springer-Verlag, 1999.
11. D. Epstein. Diameter and treewidth in minor-closed graph families. Algorithmica, 27:275-291, 2000.
12. P. Erdos and R. Rado. Intersection theorems for systems of sets. J. of London Mathematical Society, 35:85-90, 1960.
13. R. Fagin, P. G. Kolaitis, and L. Popa. Data Exchange: Getting to the Core. In Proc. 22nd ACM Symposium on Principles of Database Systems, pages 90-101, 2003.
14. T. Feder and M.Y. Vardi. Homomorphism closed vs existential positive. In Proc. of the 18th IEEE Symp. on Logic in Computer Science, pages 311-320, 2003.
15. M. Frick and M. Grohe. Deciding first-order properties of locally tree-decomposable functions. Journal of the Association for Computing Machinery, 48:1184-2006, 2000.
16. H. Gaifman. On local and nonlocal properties. In J. Stern, editor, Logic Colloquium' 81, pages 105-135. North Holland, 1982.
17. R. L. Graham, B. L. Rothschild, and J. H. Spencer. Ramsey Theory. Wiley, 1980.
18. M. Grohe. 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, 2003.
19. M. Grohe, J. Flum, and M Frick. Query evaluation via tree-decompositions. Journal of the ACM, 49:716-752, 2002.
20. M. Grohe, T. Schwentick, and Segoufin. When is the evaluation of conjunctive queries tractable? In Proc. 32nd ACM Symp. on Theory of Computing, pages 657-666, 2001.
21. Y. Gurevich. Toward logic tailored for computational complexity. In M. Richter et al., editors, Computation and Proof Theory, pages 175-216. Springer Lecture Notes in Mathematics, 1984.
22. Y. Gurevich. On finite model theory. In S.R. Buss and P.J. Scott, editors, Feasible Mathematics, pages 211-219. Birkhäuser, 1990.
23. P. Hell and J. Nesetril. The core of a graph. Discrete Math., 109:117-126, 1992.
24. W. Hodges, Model Theory. Cambridge University Press, 1993.
25. Ph. G. Kolaitis and M. Y Vardi. On the expressive power of Datalog: Tools and a case study. Journal of Computer and System Sciences, 51:110-134, 1995.
26. Ph. G. Kolaitis and M. Y Vardi. Conjunctive query containment and constraint satisfaction. Journal of Computer and System Sciences, 61:302-332, 2000.
27. M. Kreidler and D. Seese. Monadic NP and graph minors. In CSL '98: Proc. of the Annual Conference of the European Association for Computer Science Logic, volume 1584 of LNCS, pages 126-141. Springer, 1999.
28. N. Robertson and P.D. Seymour. Graph minors V. Excluding a planar graph. Journal of Combinatorial Theory, Series B, 41:92-11, 1986.
29. E. Rosen. Some aspects of model theory and finite strucrtures. Bulletin of Symbolic Logic, 8:380-403, 2002.
30. Y. Sagiv and M. Yannakakis. Equivalence between relational expressions with the union and difference operators. Journal of the Association for Computing Machinery, 27(4):633-655, 1981.
31. A. Stolboushkin. Finite monotone properties. In Proc. 10th IEEE Symp. on Logic in Computer Science, pages 324-330, 1995.
32. W. W. Tait. A counterexample to a conjecture of Scott and Suppes. Journal of Symbolic Logic, 24:15-16, 1959.
33. J.D. Ullman. Bottom-up beats top-down for Datalog. In Proc. 8th ACM Symp. on Principles of Database Systems, pages 140-149, 1989.