Expressing topological connectivity of spatial databases
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of program- ming languages for such databases to express queries related to topo- logical connectivity. It is known that the topological connectivity test is not first-order expressible. One approach to obtain a language in which connectivity queries can be expressed would be to extend FO+Poly with a generalized (or Lindström) quantifier expressing that two points belong to the same connected component of a given database. For the expression of topological connectivity, extensions of first-order languages with recursion have been studied (in analogy with the classical relational model). Two such languages are spatial Datalog and FO+Poly+While. Although both languages allow the expression of non-terminating pro- grams, their (proven for FO+Poly+While and conjectured for spatial Datalog) computational completeness makes them interesting objects of study. Previously, spatial Datalog programs have been studied for more restric- tive forms of connectivity (e.g., piece-wise linear connectivity) and these programs were proved to correctly test connectivity on restricted classes of spatial databases (e.g., linear databases) only. In this paper, we present a spatial Datalog program that correctly tests topological connectivity of arbitrary compact (i.e., closed and bounded) spatial databases. In particular, it is guaranteed to terminate on this class of databases. This program is based on a first-order description of a known topological property of spatial databases, namely that locally they are conical. We also give a very natural implementation of topological connectivity in FO+Poly+While, that is based on a first-order implementation of the curve selection lemma, and that works correctly on arbitrary spatial databases inputs. Finally, we raise the question whether topological con- nectivity of arbitrary spatial databases can also be expressed in spatial Datalog.
Source (journal)
Lecture notes in computer science. - Berlin, 1973, currens
Berlin : 2000
0302-9743 [print]
1611-3349 [online]
1949(2000), p. 224-238
Full text (Publisher's DOI)
Research group
Publication type
External links
Creation 14.04.2014
Last edited 12.07.2017