Spatiotemporal data modelling and management: a survey

Many data objects in the real world have attributes concerning location and time. Such spatiotemporal objects can be found in applications such as geographic information systems (GIS), environmental data management and multimedia databases. Traditional relational database technology is not suitable for managing spatiotemporal data, which are multi-dimensional with complex structures and behaviours. Spatiotemporal data can only be managed by the new generation of data management technologies such as object-oriented and object-relational databases. We present a comprehensive survey covering aspects from fundamental user requirements for spatiotemporal applications, spatiotemporal object modelling, object storage structures and techniques for manipulation of spatiotemporal objects such as multidimensional indexing, data structures, query evaluation strategies and architectures for spatiotemporal database management systems.

[1]  Peter Widmayer,et al.  Spatial Data Structures: Concepts and Design Choices , 1996, Algorithmic Foundations of Geographic Information Systems.

[2]  Kim S. Larsen,et al.  Relaxed Balance through Standard Rotations , 1997, WADS.

[3]  Ralf Hartmut Güting,et al.  SECONDO/QP: Implementation of a Generic Query Processor , 1999, DEXA.

[4]  Nectaria Tryfona,et al.  Requirements, definitions, and notations for spatiotemporal application environments , 1998, GIS '98.

[5]  Renato Pajarola,et al.  The Alps at your fingertips: virtual reality and geoinformation systems , 1998, Proceedings 14th International Conference on Data Engineering.

[6]  Eljas Soisalon-Soininen,et al.  Relaxed Balancing in Search Trees , 1997, Advances in Algorithms, Languages, and Complexity.

[7]  Marc van Kreveld,et al.  Algorithmic Foundations of Geographic Information Systems , 1997, Lecture Notes in Computer Science.

[8]  Timos K. Sellis,et al.  Direction Relations and Two-Dimensional Range Queries: Optimisation Techniques , 1998, Data Knowl. Eng..

[9]  Timos K. Sellis,et al.  Specifications for efficient indexing in spatiotemporal databases , 1998, Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243).

[10]  Christos Faloutsos,et al.  I/O complexity for range queries on region data stored using an R-tree , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[11]  Yannis Manolopoulos,et al.  Parallel processing of nearest neighbor queries in declustered spatial data , 1996, GIS '96.

[12]  Ding-Zhu Du,et al.  Advances in Algorithms, Languages, and Complexity , 1997 .

[13]  Yannis Manolopoulos,et al.  Overlapping B+-Trees: An Implementation of a Transaction Time Access Method , 1999, Data Knowl. Eng..

[14]  Bernhard Seeger,et al.  A Generic Approach to Bulk Loading Multidimensional Index Structures , 1997, VLDB.

[15]  Yannis Manolopoulos,et al.  Similarity query processing using disk arrays , 1998, SIGMOD '98.

[16]  Timos K. Sellis,et al.  Spatio-temporal indexing for large multimedia applications , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[17]  Vassilis J. Tsotras,et al.  Comparison of access methods for time-evolving data , 1999, CSUR.

[18]  Leonidas J. Guibas,et al.  Voronoi Diagrams of Moving Points , 1998, Int. J. Comput. Geom. Appl..

[19]  Michel Scholl,et al.  A Performance Evaluation of Spatial Join Processing Strategies , 1999, SSD.

[20]  Ralf Hartmut Güting,et al.  Abstract and discrete modeling of spatio-temporal data types , 1998, GIS '98.

[21]  Dieter Pfoser,et al.  Capturing the Uncertainty of Moving-Object Representations , 1999, SSD.

[22]  Nectaria Tryfona,et al.  Conceptual Data Modeling for Spatiotemporal Applications , 1999, GeoInformatica.

[23]  James M. Morand,et al.  A performance evaluation , 1980 .

[24]  Yannis Manolopoulos,et al.  Performance of Nearest Neighbor Queries in R-Trees , 1997, ICDT.

[25]  Peter R. Remmele,et al.  Fully Dynamic and Kinematic Voronoi Diagrams in GIS , 1999 .

[26]  Hans-Jörg Schek,et al.  The DASDBS Project: Objectives, Experiences, and Future Prospects , 1990, IEEE Trans. Knowl. Data Eng..

[27]  Nectaria Tryfona,et al.  Geographic Applications Development: Models and Tools for the Conceptual Level , 1995, ACM-GIS.

[28]  Renato Pajarola,et al.  Spatial indexing into compressed raster images: how to answer range queries without decompression , 1996, Proceedings of International Workshop on Multimedia Database Management Systems.

[29]  Bernhard Seeger,et al.  An asymptotically optimal multiversion B-tree , 1996, The VLDB Journal.

[30]  Hamid Pirahesh,et al.  Starburst Mid-Flight: As the Dust Clears , 1990, IEEE Trans. Knowl. Data Eng..

[31]  Ralf Hartmut Güting,et al.  Plug and play with query algebras: SECONDO, a generic DBMS development environment , 2000, Proceedings 2000 International Database Engineering and Applications Symposium (Cat. No.PR00789).

[32]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.

[33]  Stephan Eidenbenz,et al.  A prototype system for light propagation in terrains , 1998, Proceedings. Computer Graphics International (Cat. No.98EX149).

[34]  Timos K. Sellis,et al.  Cost models for join queries in spatial databases , 1998, Proceedings 14th International Conference on Data Engineering.

[35]  Yannis Manolopoulos,et al.  Overlapping linear quadtrees: a spatio-temporal access method , 1998, GIS '98.

[36]  Christian S. Jensen,et al.  Spatio-temporal database support for legacy applications , 1998, SAC '98.

[37]  SeegerBernhard,et al.  An asymptotically optimal multiversion B-tree , 1996, VLDB 1996.