Indexing of moving objects for location-based services

Visionaries predict that the Internet will soon extend to billions of wireless devices, or objects, a substantial fraction of which will offer their changing positions to location-based services. This paper assumes an Internet-service scenario where objects that have not reported their position within a specified duration of time are expected to no longer be interested in, or of interest to, the service. Due to the possibility of many "expiring" objects, a highly dynamic database results. The paper presents an R-tree based technique for the indexing of the current positions of such objects. Different types of bounding regions are studied, and new algorithms are provided for maintaining the tree structure. Performance experiments indicate that, when compared to the approach where the objects are not assumed to expire, the new indexing technique can improve search performance by a factor of two or more without sacrificing update performance.

[1]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[2]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[3]  David G. Kirkpatrick,et al.  The Ultimate Planar Convex Hull Algorithm? , 1986, SIAM J. Comput..

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

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

[6]  Christos Faloutsos,et al.  Hilbert R-tree: An Improved R-tree using Fractals , 1994, VLDB.

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

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

[9]  Mario A. López,et al.  The effect of buffering on the performance of R-trees , 1998, Proceedings 14th International Conference on Data Engineering.

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

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

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

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

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

[15]  S JensenChristian,et al.  Indexing the positions of continuously moving objects , 2000 .

[16]  Mengchu Cai,et al.  Parametric R-Tree: An Index Structure for Moving Objects , 2000 .

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

[18]  Christian S. Jensen,et al.  Indexing the positions of continuously moving objects , 2000, SIGMOD '00.

[19]  Dieter Pfoser,et al.  Novel Approaches in Query Processing for Moving Object Trajectories , 2000, VLDB 2000.

[20]  Peter Z. Revesz,et al.  Parametric Rectangles: A Model for Querying and Animation of Spatiotemporal Databases , 2000, EDBT.

[21]  Pankaj K. Agarwal,et al.  Maintaining approximate extent measures of moving points , 2001, SODA '01.

[22]  Dimitrios Gunopulos,et al.  Indexing Animated Objects Using Spatiotemporal Access Methods , 2001, IEEE Trans. Knowl. Data Eng..

[23]  Pankaj K. Agarwal,et al.  STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects , 2002, ALENEX.

[24]  A. Prasad Sistla,et al.  Updating and Querying Databases that Track Mobile Units , 1999, Distributed and Parallel Databases.