Moving Objects: Logical Relationships and Queries

In moving object databases, object locations in some multi-dimensional space depend on time. Previous work focuses mainly on moving object modeling (e.g., using ADTs, temporal logics) and ad hoc query optimization. In this paper we investigate logical properties of moving objects in connection with queries over such objects using tools from differential geometry. In an abstract model, object locations can be described as vectors of continuous functions of time. Using this conceptual model, we examine the logical relationships between moving objects, and between moving objects and (stationary) spatial objects in the database. We characterize these relationships in terms of position, velocity, and acceleration. We show that these fundamental relationships can be used to describe natural queries involving time instants and intervals. Based on this foundation, we develop a concrete data model for moving objects which is an extension of linear constraint databases. We also present a preliminary version of a logical query language for moving object databases.

[1]  Dimitrios Gunopulos,et al.  On indexing mobile objects , 1999, PODS '99.

[2]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[3]  Markus Schneider,et al.  A foundation for representing and querying moving objects , 2000, TODS.

[4]  A. Gray.  Modern Differential Geometry of Curves and Surfaces , 1993 .

[5]  Pankaj K. Agarwal,et al.  Indexing moving points (extended abstract) , 2000, PODS '00.

[6]  Elisa Bertino,et al.  An Extended Algebra for Constraint Databases , 1998, IEEE Trans. Knowl. Data Eng..

[7]  A. Prasad Sistla,et al.  Modeling and querying moving objects , 1997, Proceedings 13th International Conference on Data Engineering.

[8]  Ouri Wolfson,et al.  Cost and imprecision in modeling the position of moving objects , 1998, Proceedings 14th International Conference on Data Engineering.

[9]  Naphtali Rishe,et al.  Databases for Tracking Mobile Units in Real Time , 1999, ICDT.

[10]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

[11]  A. Gray,et al.  Modern Differential Geometry of Curves and Surfaces with Mathematica, Third Edition (Studies in Advanced Mathematics) , 2006 .

[12]  Jianwen Su,et al.  Finitely Representable Databases , 1997, J. Comput. Syst. Sci..

[13]  Gabriel M. Kuper,et al.  A constrant-based spatial extension to SQL , 1998, GIS '98.

[14]  Ralf Hartmut Güting,et al.  Spatio-Temporal Data Types: An Approach to Modeling and Querying Moving Objects in Databases , 1999, GeoInformatica.

[15]  John H. Reif,et al.  The complexity of elementary algebra and geometry , 1984, STOC '84.

[16]  Jan Van den Bussche,et al.  On Capturing First-Order Topological Properties of Planar Spatial Databases , 1999, ICDT.

[17]  M. Egenhofer,et al.  Point-Set Topological Spatial Relations , 2001 .

[18]  J. Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .

[19]  Jianwen Su,et al.  Towards practical constraint databases (extended abstract) , 1996, PODS.

[20]  Ouri Wolfson,et al.  Location Management in Moving Objects Databases , 1997 .

[21]  Jan Van den Bussche,et al.  On Topological Elementary Equivalence of Spatial Databases , 1997, ICDT.

[22]  Max J. Egenhofer,et al.  Reasoning about Binary Topological Relations , 1991, SSD.

[23]  Ralf Hartmut Güting,et al.  A data model and data structures for moving objects databases , 2000, SIGMOD '00.

[24]  Stéphane Grumbach,et al.  The DEDALE system for complex spatial queries , 1998, SIGMOD '98.

[25]  Bo Xu,et al.  Moving objects databases: issues and solutions , 1998, Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243).

[26]  James Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination , 1992, J. Symb. Comput..

[27]  Stéphane Grumbach,et al.  Constraint Databases , 1999, JFPLC.

[28]  Gabriel M. Kuper,et al.  Constraint Query Languages , 1995, J. Comput. Syst. Sci..

[29]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[30]  James Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I: Introduction. Preliminaries. The Geometry of Semi-Algebraic Sets. The Decision Problem for the Existential Theory of the Reals , 1992, J. Symb. Comput..

[31]  Dan Suciu,et al.  Topological queries in spatial databases , 1996, J. Comput. Syst. Sci..

[32]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[33]  W. Böge,et al.  Quantifier Elimination for Real Closed Fields , 1985, AAECC.

[34]  Stéphane Grumbach,et al.  Towards Practical Constraint Databases. , 1996, PODS 1996.

[35]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .