Region-based query languages for spatial databases in the topological data model

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider spatial databases in the topological data model, i.e., databases that consist of a finite number of labeled regions in the real plane. Such databases partition the plane further into elementary regions. We propose a first-order language, which uses elementary-region variables and label variables, to query spatial databases. All queries expressible in this first-order logic are topological and they can be evaluated in polynomial time. Furthermore, the proposed language is powerful enough to distinguish between any two spatial databases that are not topologically equivalent. This language does not allow the expression of all computable topological queries, however, as is illustrated by the connectivity query. We also study some more powerful extensions of this first-order language, e.g., with a while-loop. In particular, we describe an extension that is sound and computationally complete for the topological queries on spatial databases in the topological data model. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Forlizzi, L., Kuijpers, B., & Nardelli, E. (2003). Region-based query languages for spatial databases in the topological data model. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2750, 344–361. https://doi.org/10.1007/978-3-540-45072-6_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free