Document Server@UHasselt >
Research publications >
Please use this identifier to cite or link to this item:
|Title: ||First Order Languages Expressing Constructible Spatial Database Queries|
|Authors: ||KUIJPERS, Bart|
|Issue Date: ||1998|
|Citation: ||Labs Technical report TM 980831-4|
|Abstract: ||The research presented in this paper is situated in the framework of constraint databases that was introduced by Kanellakis, Kuper, and Revesz in their seminal paper of 1990. Constraint databases and query languages are defined using real polynomial constraints. As a consequence of a classical result by Tarski, first-order queries in the constraint database model are effectively computable, and their result is again within the constraint model.
For reasons of efficiency, this model is implemented with only linear polynomial constraints. In this case, we also have a closure property: linear queries evaluated on linear databases yield linear databases. However, the limitation to linear polynomial constraints has severe implications on the expressive power of the query language. Indeed, the constraint database model has its most
important applications in the field of spatial databases and, with only linear polynomials, the data modeling capabilities are limited and queries important for spatial applications that involve Euclidean distance are not expressible.
The aim of this paper is to identify a class of two-dimensional constraint databases and a query language within the constraint model that go beyond the linear model. Furthermore, this language should allow the expression of queries
concerning distance. Hereto, we seek inspiration in the Euclidean constructions, i.e., constructions by ruler and compass. In the course of reaching our goal, we have studied three languages for ruler-and-compass constructions. First, we present a programming language. We show that this programming language captures exactly the first-order ruler-and-compass constructions that are also expressible in the first-order constraint language with arbitrary polynomial constraints. If our programming language is extended with a while
operator, we obtain a language that is complete for all ruler-and-compass constructions in the plane, using techniques of Engeler. Secondly, we transform this programming language into a query language for finite point databases. We show that, on finite point databases, the full expressive power of this query language is that of the first-order language with arbitrary polynomial constraints. It is therefore too powerful for our purposes. We then consider a safe fragment of this language. Safe queries have the property that they map finite point relations to finite point relations that are constructible from the former using ruler and compass. This safe fragment is the key ingredient in the formulation of our main result. We prove a closure property for the class of constraint databases consisting of those planar figures that can be described by means of linear constraints
and those quadratic polynomials that describe circles. We call this class of databases the semi-circular databases. We define a query language on the class of semi-circular databases based on the notion of safe queries. When we restrict our attention to finite databases, this language captures exactly the ruler-and compass constructions.
Finally, we compare the expressive power of this new query language with the expressive power of the first-order language with linear constraints on linear databases on the one hand and with the expressive power of the first-order language with polynomial constraints on semi-circular databases on the other hand.|
|Type: ||Technical report|
|Appears in Collections: ||Research publications|
Files in This Item:
|N/A||314.11 kB||Adobe PDF|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.