Research On Topological Queries In Spatio-temporal Databases Based On Topological Relations

Spatio-temporal databases is a complex system with time and spatial attributes. At the same time, analysis and judgement of spatio-temporal data is important for data modeling, querying, sptaio-temporal analytical reasoning and data updating. Therefore researches on topological relations and application have been a new field in the development of spatio-temporal databases. Although researches on sptial database querying are growing and maturing, spatio-temporal analytical reasoning is a new discipline when increased time attribute. Recently, the researches on spatio-temporal technology are exploring, expecially in designing and achieving spatio-temporal topological predicates.On the basis of definition and description system for spatio-temoral data and topological relations, a description framework for spatio-temporal predicates and operation was proposed in this paper. At the same time, this thesis expounded spatio-temporal predicates classifically. Among all the spatio-temporal predicates, topological query is the key element. Therefore, based on the characteristics of spatio-temporal changing with time, this thesis decomposited moving objects and aggregated kinds of spatio-temproal topological relationships such as line/line, line/region, region/region, complex objects and fuzzy objects in a stringent way.Then, an abstract definition of relevant spatial objects was proposed in the thesis meticulously. First, based on the precidates between simple complex regions, this thesis designed predicates between complex regions and expanded corresponding spatio-temporal predicates. Second, two regulations were provides for uncertainty in defining topological relation. Third, the thesis extended a new idea, when modeling for topological predicates between fuzzy regions. The fuzzy predicates were proved to be self-contained and mutally exclusive. Forth, based on Realms and ROSE algebra the thesis confirmed them and introduced their algorithms. The algorithms integrated Plane Sweep technology with the factor of time interval. Finally, all the algorithms have been proved to be correct, effective and terminable.