Please use this identifier to cite or link to this item:
Title: Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic.
Authors: GEERTS, Floris 
Issue Date: 2000
Publisher: ACM Press
Source: Symposium on Principles of Database Systems. Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems. p. 126-135.
Abstract: We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate linear approximations of spatial databases and study in which language they can be expressed effectively. Specifically, we show that they cannot be expressed in the standard first-order query language for polynomial constraint databases but that an extension of this first-order language with transitive closure suffices to express the approximation query in an effective manner. Furthermore, we introduce an extension of transitive-closure logic and show that this logic is complete for the computable queries on linear spatial databases. This result together with our first result implies that this extension of transitive-closure logic can express all computable topological queries on arbitrary spatial databases in the plane.
Document URI:
Link to publication:
ISBN: 1-58113-214-X
Category: C1
Type: Proceedings Paper
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
sdcql10.pdf183.49 kBAdobe PDFView/Open
Show full item record

Page view(s)

checked on May 22, 2022


checked on May 22, 2022

Google ScholarTM



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