Document Server@UHasselt >
Research publications >
Please use this identifier to cite or link to this item:
|Title: ||Expressing Topological Connectivity of Spatial Databases|
|Authors: ||GEERTS, Floris|
|Issue Date: ||2000|
|Citation: ||Research Issues in Structured and Semistructured Database Programming: 7th International Workshop on Database Programming Language|
|Series/Report: ||Lecture Notes in Computer Science, 1949|
|Abstract: ||We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries related to topological 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 programs, 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 restrictive 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 avery 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 connectivity of arbitrary spatial databases can also be expressed in spatial Datalog.|
|Type: ||Journal Contribution|
|Appears in Collections: ||Research publications|
Files in This Item:
|N/A||177.48 kB||Adobe PDF|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.