An efficient trajectory index structure for moving objects in location-based services

3Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Because moving objects usually moves on spatial networks, efficient trajectory index structures are required to gain good retrieval performance on their trajectories. However, there has been little research on trajectory index structure for spatial networks, like road networks. In this paper, we propose an efficient trajectory index structure for moving objects in Location-based Services (LBS). For this, we design our access scheme for efficiently dealing with the trajectories of moving objects on road networks. In addition, we provide both an insertion algorithm to store the initial information of moving object trajectories and one to store their segment information. We also provide a retrieval algorithm to find a set of moving objects whose trajectories match the segments of a query trajectory. Finally, we show that our trajectory access scheme achieves about one order of magnitude better retrieval performance than TB-tree. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Chang, J. W., Um, J. H., & Lee, W. C. (2005). An efficient trajectory index structure for moving objects in location-based services. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3762 LNCS, pp. 1107–1116). https://doi.org/10.1007/11575863_133

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free