Browse > Article

Design and Implementation of a Trajectory-based Index Structure for Moving Objects on a Spatial Network  

Um, Jung-Ho (전북대학교 컴퓨터공학과)
Chang, Jae-Woo (전북대학교 컴퓨터공학과)
Abstract
Because moving objects usually move on spatial networks, efficient trajectory index structures are required to achieve good retrieval performance on their trajectories. However, there has been little research on trajectory index structures for spatial networks such as FNR-tree and MON-tree. But, because FNR-tree and MON-tree are stored by the unit of the moving object's segment, they can't support the whole moving objects' trajectory. In this paper, we propose an efficient trajectory index structure, named Trajectory of Moving objects on Network Tree(TMN Tree), for moving objects. For this, we divide moving object data into spatial and temporal attribute, and preserve moving objects' trajectory. Then, we design index structure which supports not only range query but trajectory query. In addition, we divide user queries into spatio-temporal area based trajectory query, similar-trajectory query, and k-nearest neighbor query. We propose query processing algorithms to support them. Finally, we show that our trajectory index structure outperforms existing tree structures like FNR-Tree and MON-Tree.
Keywords
Spatial Network database; trajectory; Index Structure;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. Pfoser, C.S. Jensen, and Y. Theodoridis, "Novel Approach to the Indexing of Moving Object Trajectories," In Proc. of VLDB, pp. 395-406, 2000
2 T. Brinkhoff, "A Framework for Generating Network-Based Moving Objects," In Proc. of GeoInformatica 6(2), pp. 153-180, 2002   DOI   ScienceOn
3 E. Frentzos, "Indexing Objects moving on fixed networks," In Proc. of the 8th In Proc. of Intl. Symp. on Spatial and Temporal Database(SSTD), pp. 289-305, 2003
4 D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, "Query Processing in Spatial Network Databases," In Proc. of VLDB, pp. 802-813, 2003
5 V. Chakka, A. Everspaugh, J. Patel, Indexing "Large Trajectory Data SetsWith SETI," In Proc. of the Conf. on Innovative Data Systems Research, CIDR, Asilomar, CA, Jan. 2003
6 D. Pfoser and C.S. Jensen, "Indexing of Network Constrained Moving Objects," In Proc. of ACM GIS, pp. 25-32, 2003
7 A. Guttman "R-Trees: A Dynamic Index Structure for Spatial Searching," In Proc. of SIGMOD, pp. 47-57 1984
8 Mohammad Kolahdouzan and Cyrus Shahabi, "Voronoi-Based K Neareast Neighbor Search for Spatial Network Databases," In Proc. of VLDB, pp. 840-851, 2004
9 Victor Teixeira de Almeida, Ralf Hartmut Güting. "Indexing the Trajectories z`of Moving Objects in Networks," In Proc. of GeoInformatica 9(1), pp. 33-60, 2005
10 Tao, Y., and Papadias, D. "Mv3R-tree: a spatiotemporal access method for timestamp and interval queries," In Proc. of VLDB, pp. 431-440, 2001
11 Vazirgiannis, M., Theodoridis, Y., and Sellis, T. "Spatio-temporal Indexing for Large Multimedia Applications," In Proc. of the IEEE Conference on Multimedia Computing and Systems6(4), pp. 284- 298, 1998
12 N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger: The "R*-Tree: An Efficient and Robust Access Method for Points and Rectangles," In Proc. of SIGMOD, pp. 322-331, 1990