Seo Dong-Min, Bok Kyoung-Soo, Yoo Jae Soo, Lee Byoung-Yup, Journal of Internet Computing and Services, Vol. 5, No. 4, pp. 77-94, Aug. 2004
Full Text:  HTML
Keywords: Moving Object, Spatio-Temporal index Structure, Future Position Retrieval

Abstract

Recently, the needs of index structure which manages moving objects efficiently have been increased because of the rapid development of location-based techniques. Existing index structures frequently need updates because moving objects change continuatively their positions. That caused entire performance loss of the index structures. In this paper, we propose a new index structure called the TPKDB-tree that is a spatio-temporal index structure based on KDB-tree. Our technique optimizes update costs and reduces a search time for moving objects and reduces unnecessary updates by expressing moving objects as linear functions. Thus, the TPKDB-tree efficiently supports the searches of future positions of moving objects by considering the changes of moving objects included in the node as time-parameter. To maximize space utilization, we propose the new update and split methods. Finally, we perform various experiments to show that our approach outperforms others.

Statistics
Cite this article