Please use this identifier to cite or link to this item:
Title: Termination properties of spatial Datalog programs
Authors: VAN DEN BUSSCHE, Jan 
Paredaens, Jan
Smits, Marc
Issue Date: 1996
Publisher: Springer Verlag
Source: Logic in Databases. p. 99-116.
Series/Report: Lecture Notes in Computer Science
Series/Report no.: 1154
Abstract: We consider spatial databases defined in terms of polynomial Inequalities, and investigate the use of Datalog as a query language for such databases. Recursive programs are not guaranteed to terminate in this setting. Through a series of examples we show that useful restrictions on the databases under consideration or on the syntax of allowed programs, guaranteeing termination, are unlikely to exist. Hence, termination of particular recursive spatial queries must be established by ad-hoc arguments, if it can be established at all. As an illustration of the difficulties that can be encountered in this respect we discuss the topological connectivity query.
Document URI:
ISBN: 978-3-540-61814-0
DOI: 10.1007/BFb0031737
Type: Proceedings Paper
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
term_spalog.pdf215.35 kBAdobe PDFView/Open
Show full item record


checked on Sep 2, 2020

Page view(s)

checked on May 23, 2022


checked on May 23, 2022

Google ScholarTM



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