By Topic

Indexing of Constrained Moving Objects for Current and Near Future Positions in GIS

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jing Guo ; Sch. of Comput. Sci., Wuhan Univ. ; Wei Guo ; Dongru Zhou

In geographic information system (GIS), fast and efficiently indexing moving objects are a crucial issue in several application domains, such as LBS, intelligence transportation and digital battle. In this paper, a new index structure, PQR-tree, is proposed to fast update and efficiently index the present or near future positions of constrained moving objects based on the characters of moving objects. PQR-tree is an integrated tree structure which combined PMR quadtree, quadtree and R*-tree together. Firstly, QR-tree which combined quadtree and R*-tree is used to carry out rough level partition for index space based on range region. Next, an R*-tree is used to index quasi-static objects for each subspace. Then, using a splitting rule of PMR quadtree to carry further level partition for index space based on road networks and all fast moving objects are related to the road networks. The experimental results show that PQR-tree achieves better performance for index updating and query evaluation than TPR-tree

Published in:

Computer and Computational Sciences, 2006. IMSCCS '06. First International Multi-Symposiums on  (Volume:2 )

Date of Conference:

20-24 June 2006