Indexing the positions of continuously moving objects

The coming years will witness dramatic advances in wireless communications as well as positioning technologies. As a result, tracking the changing positions of objects capable of continuous movement is becoming increasingly feasible and necessary. The present paper proposes a novel, R*-tree based indexing technique that supports the efficient querying of the current and projected future positions of such moving objects. The technique is capable of indexing objects moving in one-, two-, and three-dimensional space. Update algorithms enable the index to accommodate a dynamic data set, where objects may appear and disappear, and where changes occur in the anticipated positions of existing objects. A comprehensive performance study is reported.

[1]  Christos Faloutsos,et al.  Designing Access Methods for Bitemporal Databases , 1998, IEEE Trans. Knowl. Data Eng..

[2]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[3]  Christian S. Jensen,et al.  R-Tree Based Indexing of Now-Relative Bitemporal Data , 1998, VLDB.

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

[5]  Christian S. Jensen,et al.  R-Tree Based Indexing of General Spatio-Temporal Data , 1999 .

[6]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[7]  Eugene Wong,et al.  A dual approach to detect polyhedral intersections in arbitrary dimensions , 1991, BIT.

[8]  Özgür Ulusoy,et al.  A Quadtree-Based Dynamic Attribute Indexing Method , 1998, Comput. J..

[9]  Bernd-Uwe Pagel,et al.  Towards an analysis of range query performance in spatial data structures , 1993, PODS '93.

[10]  José Moreira,et al.  Oporto: A Realistic Scenario Generator for Moving Objects , 1999, Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99.

[11]  Mario A. López,et al.  STR: a simple and efficient algorithm for R-tree packing , 1997, Proceedings 13th International Conference on Data Engineering.

[12]  José Moreira,et al.  Representation and Manipulation of Moving Points: An Extended Data Model for Location Estimation , 1999 .

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

[14]  Jeffrey Scott Vitter,et al.  On two-dimensional indexability and optimal range search indexing , 1999, PODS '99.

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

[16]  Jeffrey Scott Vitter,et al.  Efficient searching with linear constraints , 1998, J. Comput. Syst. Sci..

[17]  Jonathan Goldstein,et al.  Processing queries by linear constraints , 1997, PODS '97.

[18]  Christos Faloutsos,et al.  On packing R-trees , 1993, CIKM '93.

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

[20]  Leonidas J. Guibas,et al.  Data structures for mobile data , 1997, SODA '97.

[21]  Mario A. López,et al.  The Effect of Buffering on the Performance of R-Trees , 2000, IEEE Trans. Knowl. Data Eng..

[22]  C. Q. Lee,et al.  The Computer Journal , 1958, Nature.

[23]  Jeffrey F. Naughton,et al.  Generalized Search Trees for Database Systems , 1995, VLDB.