On first-order topological queries

One important class of spatial database queries is the class of topological queries, that is, queries invariant under homeomorphisms. We study topological queries expressible in the standard query language on spatial databases, first-order logic with various amounts of arithmetic. Our main technical result is a combinatorial characterization of the expressive power of topological first-order logic on regular spatial databases.

[1]  Michael Benedikt,et al.  Languages for relational databases over interpreted structures , 1997, PODS '97.

[2]  Jan Van den Bussche,et al.  On Topological Elementary Equivalence of Spatial Databases , 1997, ICDT.

[3]  Jan Van den Bussche,et al.  On Capturing First-Order Topological Properties of Planar Spatial Databases , 1999, ICDT.

[4]  Victor Vianu,et al.  Querying spatial databases via topological invariants , 1998, J. Comput. Syst. Sci..

[5]  Jan Van den Bussche,et al.  First-Order Queries on Finite Structures Over the Reals , 1998, SIAM J. Comput..

[6]  Jan Van den Bussche,et al.  Topological elementary equivalence of closed semi-algebraic sets in the real plane , 2000, Journal of Symbolic Logic.

[7]  Michael Benedikt,et al.  Reachability and connectivity queries in constraint databases , 2000, J. Comput. Syst. Sci..

[8]  Martin Grohe,et al.  Fixed-point logics on planar graphs , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[9]  Limsoon Wong,et al.  Relational expressive power of constraint query languages , 1996, PODS.

[10]  Jianwen Su,et al.  Finitely Representable Databases , 1997, J. Comput. Syst. Sci..

[11]  Victor Vianu,et al.  Topological Queries in Spatial Databases , 1999, CSL.

[12]  L. van den Dries,et al.  Tame Topology and O-minimal Structures , 1998 .

[13]  Dan Suciu,et al.  Topological queries in spatial databases , 1996, J. Comput. Syst. Sci..

[14]  Jan Paredaens,et al.  Towards a theory of spatial database queries (extended abstract) , 1994, PODS.

[15]  Stéphane Grumbach,et al.  Constraint Databases , 1999, JFPLC.

[16]  Marcel Paul Schützenberger,et al.  On Finite Monoids Having Only Trivial Subgroups , 1965, Inf. Control..

[17]  Jianwen Su,et al.  Queries with Arithmetical Constraints , 1997, Theor. Comput. Sci..

[18]  Y. Gurevich.  On Finite Model Theory , 1990 .

[19]  Michael Benedikt,et al.  Expressive Power: The Finite Case , 2000, Constraint Databases.

[20]  Robert E. Tarjan,et al.  Isomorphism of Planar Graphs , 1972, Complexity of Computer Computations.

[21]  D. V. Gucht,et al.  First-order queries on finite structures over the reals , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[22]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[23]  Robert McNaughton,et al.  Counter-Free Automata (M.I.T. research monograph no. 65) , 1971 .

[24]  R. McNaughton,et al.  Counter-Free Automata , 1971 .

[25]  Michael Benedikt,et al.  Safe constraint queries , 1998, SIAM J. Comput..

[26]  Jan Van den Bussche,et al.  Complete geometrical query languages , 1997, PODS 1997.

[27]  Jan Van den Bussche,et al.  Towards a theory of spatial database queries (extended abstract) , 1994, PODS '94.

[28]  Jan Van den Bussche,et al.  Complete Geometric Query Languages , 1999, J. Comput. Syst. Sci..