By Topic

Quadtree and Hash Table Based Index Structure for Indexing the Past, Present and Future Positions of Moving Objects

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)
Dong Li ; Sch. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou ; Yu-hui Peng ; Jiang-long Yin

Traditional index structures do not work well on moving objects because of the need of frequently updating the index which leads to the poor performance. This paper presents a novel index structure based on the improved Quadtree and Hash table, namely the QH-index which can index the past, present and future positions of moving objects and can support moving objects' range queries and point queries that include the object identifier based query. Merging timely the corresponding nodes to degrade the depth of the tree can guarantee the query efficiency. Our experiments show that the QH-index gains much better performance in updating and in querying by the object identifier than those of the TPR-tree, and the efficiency of range query is no less than that of TPR-tree.

Published in:

Computer Science and its Applications, 2008. CSA '08. International Symposium on

Date of Conference:

13-15 Oct. 2008