Browse > Article

Design and implementation of a time-based R-tree for indexing moving objects  

전봉기 (부산대학교 컴퓨터공학과)
홍봉희 (부산대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Databases / v.30, no.3, 2003 , pp. 320-335 More about this Journal
Abstract
Location-Based Services(LBS) give rise to location-based queries of which results depend on the locations of moving objects. One of important applications of LBS is to examine tracks of continuously moving objects. Moving objects databases need to provide 3-dimensional indexing for efficiently processing range queries on the movement of continuously changing positions. An extension of the 2-dimensional R-tree to include time dimension shows low space utilization and poor search performance, because of high overlap of index nodes and their dead space. To solve these problems, we propose a new R-tree based indexing technique, namely TR-tree. To increase storage utilization, we assign more entries to the past node by using the unbalanced splitting policy. If two nodes are highly overlapped, these nodes are forcibly merged. It is the forced merging policy that reduces the dead space and the overlap of nodes. Since big line segments can also affect the overlap of index nodes to be increased, big line segments should be clipped by the clipping policy when splitting overfull nodes. The TR-tree outperforms the 3DR-tree and TB-tree in all experiments. Particularly, the storage utilization of the TR-tree is higher than the R-tree and R*-tree.
Keywords
Moving Objects; Moving Object Database; GIS; Spatial Indexing;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. Tayeb, O. Ulusoy, and O. Wolfson. A Quadtree Based Dynamic Attribute Indexing Method, The Computer Journal, 41(3), p185-200, 1998   DOI   ScienceOn
2 Y. Theodoridis, J. R. O Silva and M.A Nascimento, On the Generation of Spatiotemporal Datasets, SSD, LNCS 1651, p147-164, 1999
3 H. Samet, The design and analysis of spatial data structures, Reading, MA: Addision-Wesley, 1989
4 J. T. Robinson, The K-D-B-tree: A search structure for large multidimensional dynamic indexes, ACM SIGMOD Conference, p10-18, 1981   DOI
5 A. Guttman, Rrtrces: A dynamic index structure for spatial searching, ACM SIGMOD Conference, p47-54, 1984   DOI
6 Y. Tao and D. Papadias, MV3R-Tree: A SpatioTemporal Access Method for Timestamp and Interval Queries, Proceedings of International Conference on VLDB, p431-440, 2001
7 S. Berchtold, D. A. Keirn, H. P. Kriegel, The X -tree: An Index Structure for High-Dimensional Data, International Conference on Very Large Data Bases, p28-39, 1996
8 D. Greene, An Implementation and Performance Analysis of Spatial Data Access Methods, Proceedings of International Conference on Data Engineering, IEEE, p606-615, 1989   DOI
9 S. Saltenis, C. S. Jensen, S.T. Leutenegger, and M. A. Lopez, Indexing the Positions of Continuously Moving Objects, In Proc. ACM SIGMOD on Management of data, p331- 342, 2000   DOI
10 Z. Song and N. Roussopoulos, Hashing Moving Object, Intl. Conf. on Mobile Data Management, p161-172, 2001
11 D. Pfoser, C.S. Jensen, and Y. Theodoridis, Novel Approaches in Query Processing for Moving Objects, In Proc. of the VLDB Conference, p395406, 2000
12 N. Beckmann and H. P. Kriegel, 'The R*-tree: An Efficient and Robust Access Method for Points and Rectangles', In Proc. ACM SIGMOD, p332-331, 1990   DOI
13 T. K. Sellis, N. Roussopoulos and C. Faloutsos, 'The Rr-Tree: A Dynamic Index for Multi-Dimensional Objects', Proceedings of the 13th VLDB Conference, p507-518, 1987
14 D. Pfoser, Y. Theodoridis, and C.S. Jensen, Indexing Trajectories in Query Processing for Moving Objects, CHROochronos Technical Report, CH-99-3, October, 1999
15 Y. Theodoridis, M. Vazirgiannis, and T. K. Sellis, Spatio-Temporal Indexing for Large Multimedia Applications, IEEE International Conference on Multimedia Computing and Systems, p441-448, 1996   DOI
16 M. A. Nascimento and J. R. O. Silva, Towards historical R-trees, ACM symposium on Applied Computing, p235-240, 1998   DOI