Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2005.12D.4.507

Policies of Trajectory Clustering in Index based on R-trees for Moving Objects  

Ban ChaeHoon (경남정보대학 인터넷응용계열)
Kim JinGon (삼성전자 소프트웨어랩 무선 4그룹)
Jun BongGi (신라대학교 컴퓨터정보공학부)
Hong BongHee (주산대학교 공과대학 컴퓨터공학과)
Abstract
The R-trees are usually used for an index of trajectories in moving-objects databases. However, they need to access a number of nodes to trace same trajectories because of considering only a spatial proximity. Overlaps and dead spaces should be minimized to enhance the performance of range queries in moving-objects indexes. Trajectories of moving-objects should be preserved to enhance the performance of the trajectory queries. In this paper, we propose the TP3DR-tree(Trajectory Preserved 3DR-tree) using clusters of trajectories for range and trajectory queries. The TP3DR-tree uses two split policies: one is a spatial splitting that splits the same trajectory by clustering and the other is a time splitting that increases space utilization. In addition, we use connecting information in non-leaf nodes to enhance the performance of combined-queries. Our experiments show that the new index outperforms the others in processing queries on various datasets.
Keywords
Moving Object Database; Spatiotemporal Database; Trajectory Query; Split Policy;
Citations & Related Records
연도 인용수 순위
  • Reference
1 B.-U. Pagel, H.-W. Six, H. Toben, and P. Widmayer, 'Towards an analysis of range query performance in spatial data structures.' Proc. of the ACM Symopsium on Principles of Database Systems, pp. 214-221, 1993   DOI
2 B. Jun, B. Hong, and B. Yu, 'Dynamic splitting policies of the adaptive 3DR-tree for indexing continuously moving objects.' int'l Conf. on Database and Expert Systems Applications, September, 2003   DOI
3 Y. Theodoridis, J. R. O Silva, and M.A Nascimento, 'On the generation of spatiotemporal datasets.' Proc. of Int'l Symposium on Spatial Databases, pp.147-164, 1999
4 Y. Theodoridis, M. Vazirgiannis, and T. K. Sellis, 'Spatio-temporal indexing for large multinedia applications.' IEEE Int'l Conf. on Multimedia Computing and Systems, pp. 441-448, 1996   DOI
5 D. Pfoser, 'Indexing the trajectories of moving objects.' IEEE Data Engineering Bulletin, Vol.25, No. 2, pp.3-9, 2002
6 D. Pfoser, C. S. Jensen, and Y. Theodoridis, 'Novel approaches in query processing for moving objects.' Proc. of Int'l Conf. on Very Large Data Bases, pp.395-406, 2000
7 Y. Theodoridis, T. K. Sellis, A. Papadopoulos, and Y. Manolopoulos, 'Specifications for efficient indexing in spatiotemporal databases.' Int'l Conf. on Scientific and Statistical Database Management, pp.123-132, 1998   DOI
8 T. K. Sellis, N. Roussopoulos, and C. Faloutsos, 'The R+-Tree: A dynamic index for multi-dimensional objects.' Proc. of Int'l Conf. on Very Large Data Bases. pp.507-518, 1987
9 A. P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao, 'Modeling and querying moving objects.' Int'l Conf. on Data Engineering, pp.422-432, 1997   DOI
10 M. A. Nascimento, J. R. O. Silva, and Y. Theodoridis, 'Evaluation of access structures for discretely moving points.' Proc. of Int'l Workshop on Spatio-Temporal Database Management, pp.171-188, 1999
11 N. Beckmann and H. P. Kriegel, 'The R*-tree: An efficient and robust access method for points and rectangles.' Proc. of the ACM SIGMOD Int'l Conf. on Management of Data, pp.332-331, 1990   DOI
12 A. Guttman, 'R-trees: A dynamic index structure for spatial searching.' Proc. of the ACM SIGMOD Int'l Conf. on Management of Data, pp.47-54, 1984   DOI
13 M. Hadjieleftheriou, G. Kollios, V. J. Tsotras, and D. Gunopulos, 'Efficient indexing of spatiotemporal objects,' Int'l Conf. on Extending Database Technology, pp.251-268, 2002
14 M. A. Nascimento, J. R. O Silva, and Y. Theodoridis. 'Access structure for moving points.' TimeCenter Technical Report TR-33, 1998
15 S. Berchtold, D. A. Keim, and H. P. Kriegel, 'The X-tree: An index structure for high-dimensional data.' Proc. of Int'l Conf. on Very Large Data Bases, pp.28-39, 1996
16 D. Pfoser, Y. Theodoridis, and C. S. Jensen, 'Indexing trajectories in query processing for moving objects.' Chorochronos Technical Report, CH-99-3, October, 1999