2002
DOI: 10.1007/3-540-46093-4_12
|View full text |Cite
|
Sign up to set email alerts
|

A Theory of Spatio-temporal Database Queries

Abstract: 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, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
13
0

Year Published

2004
2004
2020
2020

Publication Types

Select...
2
2
2

Relationship

4
2

Authors

Journals

citations
Cited by 8 publications
(14 citation statements)
references
References 21 publications
1
13
0
Order By: Relevance
“…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%
See 1 more Smart Citation
“…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%
“…The proofs of these sound and completeness results are inspired by earlier work on complete languages for spatial [10] and spatio-temporal databases [4]. Compared to [4], the language we propose is far more user oriented since it is not based on geometric but speed-related predicates.…”
Section: Introductionmentioning
confidence: 96%
“…The proofs of these sound and completeness results are inspired by earlier work on complete languages for spatial [10] and spatio-temporal databases [4]. Compared to [4], the language we propose is far more user oriented since it is not based on geometric but speed-related predicates. We remark that the completeness and soundness results presented in this paper hold for arbitrary spatio-temporal data, but we present them for trajectory (sample) data for which the bead model is specifically designed.…”
Section: Introductionmentioning
confidence: 96%
See 1 more Smart Citation