Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/630

Title: Termination properties of spatial Datalog programs
Paredaens, Jan
Smits, Marc
Issue Date: 1996
Publisher: Springer Verlag
Citation: Logic in Databases. p. 99-116.
Series/Report: Lecture Notes in Computer Science, 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.
URI: http://hdl.handle.net/1942/630
DOI: 10.1007/BFb0031737
ISBN: 978-3-540-61814-0
Type: Proceedings Paper
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
N/A215.35 kBAdobe PDF

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