An efficient moving query method in mobile computing environment

The indexing method for grouping the moving objects with Grid (GG TPR-tree) has great efficiency to manage a great capacity of moving objects within a limited area, but it only could meet a part of requirements for moving query if the GG TPR-tree was used solely. In this paper, we summary the existing query technology and its shortage. And then, In order to put forward the universal method to response moving query, through analyzing the mobile mode of the moving objects, we improve an efficient moving query method in which mobile objects are separated and grouped according to kinds of query for moving objects in the space. Using the kinds of queries, the double R-tree and double indexing structure is developed base on the GG TPR-tree indexing structure to meet the requirements for the indexing maintenance and query of moving objects.

[1]  Yufei Tao,et al.  Venn sampling: a novel prediction technique for moving objects , 2005, 21st International Conference on Data Engineering (ICDE'05).

[2]  Sunil Prabhakar,et al.  An efficient location update mechanism for continuous queries over moving objects , 2007, Inf. Syst..

[3]  Chen Hongsheng,et al.  An Efficient Prediction Technique for Range Aggregation of Moving Objects , 2007 .

[4]  Richard T. Snodgrass,et al.  Spatiotemporal aggregate computation: a survey , 2005, IEEE Transactions on Knowledge and Data Engineering.

[5]  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.

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

[7]  Xing Gao,et al.  Window Query Processing with Proxy Cache , 2006, 7th International Conference on Mobile Data Management (MDM'06).

[8]  Kien A. Hua,et al.  Dynamic Range Query in Spatial Network Environments , 2006, DEXA.