An Improved Split Algorithm for Indexing of Moving Object Trajectories


The KIPS Transactions:PartD, Vol. 16, No. 2, pp. 161-168, Apr. 2009
10.3745/KIPSTD.2009.16.2.161,   PDF Download:

Abstract

Recently, use of various position base servicesthat collect position information for moving object and utilize in real life is increasing by the development of wireless network technology. Accordingly, new index structures are required to efficiently retrieve the consecutive positions of moving objects. This paper addresses an improved trajectory split algorithm for the purpose of efficiently supporting spatio-temporal range queries using index structures that use Minimum Bounding Rectangles(MBR) as trajectory approximations. We consider volume of Extended Minimum Bounding Rectangles (EMBR) to be determined by average size of range queries. Also, Use a priority queue to speed up our process. This algorithm gives in general sub-optimal solutions with respect to search space. Our improved trajectory split algorithm is going to derive minimizing volume of EMBRs better than previously proposed split algorithm.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
H. J. Jeon, J. H. Park, H. S. Park, W. H. Cho, "An Improved Split Algorithm for Indexing of Moving Object Trajectories," The KIPS Transactions:PartD, vol. 16, no. 2, pp. 161-168, 2009. DOI: 10.3745/KIPSTD.2009.16.2.161.

[ACM Style]
Hyun Jun Jeon, Ju Hyun Park, Hee Suk Park, and Woo Hyun Cho. 2009. An Improved Split Algorithm for Indexing of Moving Object Trajectories. The KIPS Transactions:PartD, 16, 2, (2009), 161-168. DOI: 10.3745/KIPSTD.2009.16.2.161.