Towards a theory of spatial database queries (extended abstract)

Paredaens, Jan; Bussche, Jan Van den; Gucht, Dirk Van

doi:10.1145/182591.182640

Cited by 111 publications

(88 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Since the early 1990s, various database systems have been developed to handle spatial data [1,5,10,14,16,26] and solid theories for such systems have been proposed and studied [21,23]. Conceptually, spatial databases are possibly infinite sets of points in a real space R n .…”

Section: Introductionmentioning

confidence: 99%

“…In the context of the relational database model, Chandra and Harel [6] formalized this independence of the actual encoding in terms of the notion of genericity. Paredaens, Van den Bussche and Van Gucht [23] identified a hierarchy of genericity classes for spatial database applications. The generic queries in the different classes focus on different geometrical and topological aspects of the spatial data.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Theory of Spatio-temporal Database Queries

Geerts

Haesevoets

Kuijpers

2002

Database Programming Languages

View full text Add to dashboard Cite

Abstract. We address a fundamental question concerning spatio-temporal database systems: "What are exactly spatio-temporal queries?" We define spatio-temporal queries to be computable mappings that are also generic, meaning that the result of a query may only depend to a limited extent on the actual internal representation of the spatio-temporal data. Genericity is defined as invariance under transformations that preserve certain characteristics of spatio-temporal data (e.g., collinearity, distance, velocity, acceleration, ...) that are relevant to a database user. These transformations also respect the monotone nature of time. We investigate different genericity classes relative to the constraint database model for spatio-temporal databases and we identify sound and complete languages for the first-order, respectively the computable, queries in these genericity classes.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Theory of Spatio-temporal Database Queries

Geerts

Haesevoets

Kuijpers

2002

Database Programming Languages

View full text Add to dashboard Cite

show abstract

“…In the area of spatial database research, much attention has been payed to affine invariance of both data description and manipulation techniques and queries [12][13][14]. The main idea of working in an affine invariant way is to obtain methods and techniques that are not affected by affine transformations of the ambient space in which the data is situated.…”

Section: Summary Of Resultsmentioning

confidence: 99%

“…Also, in computer graphics, affine-invariant norms and triangulations have been studied [19]. In the field of spatial and spatio-temporal constraint databases [20,21], affine-invariant query languages [12][13][14] have been proposed. For spatial data, there exist several triangulation algorithms, but, apart from the triangulation of Nielson [19], their output is not affine-invariant.…”

Section: Summary Of Resultsmentioning

confidence: 99%

Affine-Invariant Triangulation of Spatio-Temporal Data with an Application to Image Retrieval

Haesevoets¹,

Kuijpers

Révész

2017

IJGI

View full text Add to dashboard Cite

Abstract:In the geometric data model for spatio-temporal data, introduced by Chomicki and Revesz , spatio-temporal data are modelled as a finite collection of triangles that are transformed by time-dependent affinities of the plane. To facilitate querying and animation of spatio-temporal data, we present a normal form for data in the geometric data model. We propose an algorithm for constructing this normal form via a spatio-temporal triangulation of geometric data objects. This triangulation algorithm generates new geometric data objects that partition the given objects both in space and in time. A particular property of the proposed partition is that it is invariant under time-dependent affine transformations, and hence independent of the particular choice of coordinate system used to describe the spatio-temporal data in. We can show that our algorithm works correctly and has a polynomial time complexity (of reasonably low degree in the number of input triangles and the maximal degree of the polynomial functions that describe the transformation functions). We also discuss several possible applications of this spatio-temporal triangulation. The application of our affine-invariant spatial triangulation method to image indexing and retrieval is discussed and an experimental evaluation is given in the context of bird images.

show abstract

“…It is our purpose to study linear, spatial databases from a general perspective b y o ering a constraint-based data model and a calculus-like query language with an equivalent algebra. To do this, we took the most liberal restriction possible of an existing very general and non-linear spatial database model, considered by P aredaens et al 28]. …”

Section: Semi-linear Setsmentioning

confidence: 99%

On the desirability and limitations of linear spatial database models

Vandeurzen

Gyssens

Gucht

1995

Advances in Spatial Databases

View full text Add to dashboard Cite

Abstract. A general linear spatial database model is presented in which both the representation and the manipulation of non-spatial data is based on rst-order logic over the real numbers with addition. We rst argue the naturalness of our model and propose it as a general framework to study and compare linear spatial database models. However, we also establish that no reasonable safe extension of our data manipulation language can be complete for the linear spatial queries in that even very simple queries such as deciding colinearity or computing convex hull of a nite set of points cannot be expressed. We s h o w that this fundamental result has serious rami cations for the way i n w h i c h query languages for linear spatial database models have to be designed.

show abstract

Towards a theory of spatial database queries (extended abstract)

Cited by 111 publications

References 13 publications

A Theory of Spatio-temporal Database Queries

A Theory of Spatio-temporal Database Queries

Affine-Invariant Triangulation of Spatio-Temporal Data with an Application to Image Retrieval

On the desirability and limitations of linear spatial database models

Contact Info

Product

Resources

About