Browse > Article

Design and Implementation of Trajectory Riving Tree for Combined Queries in Moving Object Databases  

임덕성 (영진전문대학 컴퓨터정보기술계열)
전봉기 (신라대학교 컴퓨터정보공학)
홍봉희 (부산대학교 컴퓨터공학)
조대수 (한국전자통신연구원 LBS 연구팀)
Publication Information
Journal of KIISE:Databases / v.31, no.2, 2004 , pp. 150-162 More about this Journal
Abstract
Moving objects have characteristics that they change continuously their positions over time. The movement of moving objects should be stored on trajectories for processing past queries. Moving objects databases need to provide spatio-temporal index for handling moving objects queries like combined queries. Combined queries consist of a range query selecting trajectories within a specific range and a trajectory query extracting to parts of the whole trajectory. Access methods showing good performance in range queries have a shortcoming that the cost of processing trajectory Queries is high. On the other hand, trajectory-based index schemes like the TB-tree are not suitable for range queries because of high overlaps between index nodes. This paper proposes new TR(Trajectory Riving)-tree which is revised for efficiently processing the combined queries. This index scheme has several features like the trajectory preservation, the increase of the capacity of leaf nodes, and the logical trajectory riving in order to reduce dead space and high overlap between bounding boxes of nodes. In our Performance study, the number of node access for combined queries in TR-tree is about 25% less than the STR-tree and the TB-tree.
Keywords
Moving Objects Databases; Moving Objects Indexing; Range Query; Trajectory Query;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Volker Gaede, Oliver Gunther, Multidimensional access methods, ACM Computing Surveys (CSUR) June 1998
2 Mario A. Nascimento, Jefferson R.O. Silva, Towards historical R-trees, Proceedings of the 1998 ACM symposium on Applied Computing February 1998   DOI
3 Theodoridis, Y., Silva, R., and Nascimento, M.: On the Generation of Spatiotemporal Datasets. In Proc. of the 6th Int'l Symposium on Spatial Databases, pp.147-164, 1999
4 A. Guttman, R-trees: A dynamic index structure for spatial searching, ACM SIGMOD Conference, pp.47-54, 1984   DOI
5 Martin Erwig, Markus Schneider: Spatio-Temporal Predicates, TKDE 14(4): 881-901: 2002   DOI   ScienceOn
6 Dieter Pfoser, Christian S. Jensen, Yannis Theodoridis: Novel Approaches in Query Processing for Moving Object Trectories, VLDB 2000: 395-406
7 J. Tayeb, O. Ulusoy, and O. Wolfson, A Quadtree Based Dynamic Attribute Indexing Method, The Computer Journal, 41(3), pp.185-200, 1998   DOI   ScienceOn
8 Theoderidis, Y.;Vazirgiannis, M.; Sellis, T. Spatiotemporal indexing for large multimedia applications, Multimedia Computing and Systems, 1996. Proceedings of the Third IEEE International Conference on, 1996 Page(s): 441-448   DOI
9 N. Beckmann and H.P. Kriegel, The R*-tree: An Efficient and Robust Access Method for Points and Rectangles, In Proc. ACM SIGMOD, pp.332-331, 1990   DOI
10 Y. Tao and D. Papadias, 'MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries,' Proceedings of International Conference on VLDB, pp.431-440, 2001
11 N. Beckmann and H.P. Kriegel, The R*-tree: An Efficient and Robust Access Method for Points and Rectangles, In Proc. ACM SIGMOD, pp.332-331, 1990   DOI
12 S. Berchtold, D. A. Keim, H. P. Kriegel, The X-tree : An Index Structure for High-Dimensional Data, International Conference on Very Large Data Bases, pp.28-39, 1996
13 V. Prasad Chakka, Adam Everspaugh, and Jignesh M.Patel, Indexing Large Trajectory Data Sets with SETI, CIDR 2003
14 T.K. Sellis, N. Roussopoulos and C. Faloutsos, The R*-Tree: A Dynamic Index for Multi-Dimensional Objects, Proceedings of the 13th VLDB Conference, pp.507-518, 1987