On First-Order Topological Queries

ACM Transactions on Computational Logic

Volumn 3, Issue 3, 2002, Pages 336-358

  Grohe, Martin ^a   Segoufin, Luc ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b INRIA ROCQUENCOURT   (France)

Author keywords

Constraint databases; first order logic; Languages; Theory; topological queries

Indexed keywords

EID: 0347252067     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/507382.507384     Document Type: Article

References (19)

1. Abiteboul, S., Hull, R., and Vianu, V. 1995. Foundations of Databases. Addison-Wesley, Reading, MA
2. Benedikt, M., Dong, G., Libkin, L., and Wong, L. 1998. Relational expressive power of constraint query languages. Journal of the ACM 45, 1, 1-34
3. Benedikt, M., Grohe, M., Libkin, L., and Segoufin, L. 2000. Reachability and connectivity queries in constraint databases. In Proceedings of the 19th ACM Symposium on Principles of Database Systems. ACM Press, New York, 104-115
4. Benedikt, M. and Libkin, L. 2000. Expressive power: The finite case. In Constraint Databases, G. Kuper, L. Libkin, and J. Paredaens, Eds. Springer-Verlag, Berlin, Germany, Chapter 3, 55-88
5. Ebbinghaus, H.-D. and Flum, J. 1995. Finite Model Theory, 2nd ed. Springer-Verlag, Berlin, Germany
6. Grohe, M. 1998. Fixed-point logics on planar graphs. In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer, Science Press, Los Alamitos, CA
7. Grumbach, S. and Su, J. 1997a. Finitely representable databases. J. Comput. Syst. Sci. 55, 2, 273-298
8. Grumbach, S. and Su, J. 1997b. Queries with arithmetical constraints. Theoret. Comput. Sci. 173, 1, 151-181
9. Gyssens, M., Van Den Bussche, J., and Van Gucht, D. 1999. Complete geometrical query languages. J. Comput. Syst. Sci. 58, 3, 483-511
10. Hopcroft, J.E. and Tarjan, R. 1972. Isomorphism of planar graphs. In Complexity of Computer Computations. Plenum Press, New York
11. Kuijpers, B., Paredaens, J., and Van Den Bussche, J. 2000. Topological elementary equivalence of closed semi-algebraic sets in the real plane. J. Symbolic Logic, 65, 4, 1530-1555
12. Kuijpers, B. and Van Den Bussche, J. 1999. On capturing first-order topological properties of planar spatial databases. In Proceedings ofthe 7th International Conference on Database Theory, C. Beeri and P. Buneman, Eds. Lecture Notes in Computer Science, vol. 1540. Springer-Verlag, Berlin, Germany, 187-198
13. Kuper, G., Libkin, L., and Paredaens, J., Eds. 2000. Constraint Databases. Springer-Verlag, Berlin, Germany
14. Mcnaughton, R. and Papert, S. 1971. Counter-Free Automata. MIT Press, Cambridge, MA
15. Papadimitriou, C., Suciu, D., and Vianu, V. 1999. Topological queries in spatial databases. J. Comput. Syst. Sci. 58, 1, 29-53
16. Paredaens, J., Van Den Bussche, J., and Van Gucht, D. 1994. Towards a theory of spatial database queries. In Proceedings ofthe 13th ACM Symposium on Principles of Database Systems. ACM Press, New York, NY, 279-288
17. Schtutzenberger, M. 1965. On finite monoids having only trivial subgroups. Inform. Control 8, 190-194
18. Segoufin, L. and Vianu, V. 2000. Querying spatial databases via topological invariants. J. Comput. Syst. Sci. 61, 2, 270-301
19. Van Den Dries, L. 1998. Tame Topology and O-minimal Structures. Cambridge University Press, Cambridge, U.K