Please use this identifier to cite or link to this item:
Title: On expressing topological connectivity in spatial Datalog.
Authors: KUIJPERS, Bart 
Smits, Marc
Issue Date: 1996
Publisher: Springer-Verlag
Source: Constraint Databases and Applications. p. 116-133.
Series/Report: Lecture Notes in Computer Science
Series/Report no.: 1191
Abstract: We consider two-dimensional spatial databases defined in terms of polynomial inequalities and investigate the expressibility of the topological connectivity query for these databases in spatial Datalog. In [10], a spatial Datalog program for piecewise linear connectivity was given and proved to correctly test the connectivity of linear spatial databases. In particular, the program was proved to terminate on these inputs. Here, we generalize this result and give a program that correctly tests connectivity of spatial databases definable by a quantifier-free formula in which at most quadratic polynomials appear. We also show that a further generalization of our approach to spatial databases that are only definable in terms of polynomials of higher degree is impossible. The class of spatial databases that can be defined by a quantifier-free formula in which at most quadratic polynomials appear is shown to be decidable. Finally, we give a number of possible other approaches to attack the problem of expressing the connectivity query for arbitrary two-dimensional spatial databases in spatial Datalog.
Document URI:
ISBN: 978-3-540-62501-8
DOI: 10.1007/3-540-62501-1_29
Type: Proceedings Paper
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
sdcql23.pdf163.24 kBAdobe PDFView/Open
Show full item record


checked on Sep 2, 2020

Page view(s)

checked on May 20, 2022


checked on May 20, 2022

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.