Querying about the Near Future Positions of Moving Objects

Moving objects continuously generate large amounts of spatio-temporal data. Maintaining and querying the location information of moving objects are a crucial problem. This paper focuses on the query problems of indexing structure for moving objects. The main focus of query processing is retrieval of approximate future movement information about moving objects that may be unavailable. First, a VPMR-tree is proposed for indexing the moving objects in road networks. Second, exponential smoothing method for predicting the result of queries that refer to the future is implemented. The experimental results have shown that VPMR-tree achieves a better performance for query evaluation than TPR-tree

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

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

[3]  Ralf Hartmut Güting,et al.  Indexing the Trajectories of Moving Objects in Networks* , 2004, GeoInformatica.

[4]  Sunil Prabhakar,et al.  Q+Rtree: efficient indexing for moving object databases , 2003, Eighth International Conference on Database Systems for Advanced Applications, 2003. (DASFAA 2003). Proceedings..

[5]  Dimitrios Gunopulos,et al.  Indexing mobile objects using dual transformations , 2004, The VLDB Journal.

[6]  Thomas Brinkhoff,et al.  A Framework for Generating Network-Based Moving Objects , 2002, GeoInformatica.

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

[8]  Jimeng Sun,et al.  Querying about the past, the present, and the future in spatio-temporal databases , 2004, Proceedings. 20th International Conference on Data Engineering.

[9]  Christian S. Jensen,et al.  Lopez: "Indexing the Positions of Continuously Moving Objects , 2000, SIGMOD 2000.

[10]  Dieter Pfoser.  Indexing the Trajectories of Moving Objects , 2002 .

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

[12]  Beng Chin Ooi,et al.  Frequent update and efficient retrieval: an oxymoron on moving object indexes? , 2002, Proceedings of the Third International Conference on Web Information Systems Engineering (Workshops), 2002..

[13]  Mario A. Nascimento,et al.  Towards historical R-trees , 1998, SAC '98.

[14]  Christian S. Jensen,et al.  Techniques for efficient road-network-based tracking of moving objects , 2005, IEEE Transactions on Knowledge and Data Engineering.

[15]  Hanan Samet,et al.  Speeding up construction of PMR quadtree-based spatial indexes , 2002, The VLDB Journal.

[16]  Ki-Joune Li,et al.  Fast indexing and updating method for moving objects on road networks , 2003, Fourth International Conference on Web Information Systems Engineering Workshops, 2003. Proceedings..

[17]  Sukho Lee,et al.  Indexing the current positions of moving objects using the lazy update R-tree , 2002, Proceedings Third International Conference on Mobile Data Management MDM 2002.