Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지

A Study on Spatial-temporal indexing for querying current and past positions

현재와 과거 위치 질의를 위한 시공간 색인에 관한 연구

  • Jun, Bong-Gi (Detp.of Computer Information Engineering, Silla University)
  • Published : 2004.10.01

Abstract

The movement of continuously changing positions should be stored and indexed for querying current and past positions. A simple extension of the original R-tree to add time as another dimension, called 3D R-tree, does not handle current position queries and does not address the problem of low space utilization due to high overlap of index nodes. In this paper, 1 propose the dynamic splitting policy for improving the 3D R-tree in order to improve space utilization of split nodes. 1 also extend the original 3D R-tree by introducing a new tagged index structure for being able to query the current and past positions of moving objects. 1 found out that my extension of the original R-tree, called the tagged dynamic 3DR-tree, outperforms both the 3D R-tree and 75-tree when querying current and past position.

Keywords

File

Download PDF

References

  1. Y. Theodoridis, M. Vazirgiannis, and T. K. Sellis, 'Spatio-temporal indexing for large multimedia applications,' IEEE Int'l Conf. on Multimedia Computing and Systems, pp. 441-448, 1996
  2. D. Pfoser, C. S. Jensen, and Y. Theodoridis, 'Novel approaches in query processing for moving objects,' Proc. of Inn Conf. on Very Large Data Bases, pp. 395-406, 2000
  3. A. Guttman, 'R-trees: A dynamic index structure for spatial searching,' Proc. of the ACM SIGMOD ConE. , pp. 47-54, 1984
  4. J. T. Robinson, 'The K-D-B-tree: A search structure for large multidimensional dynamic indexes,' Proc. of the ACM SIGMOD Conf. , pp. 10-18, 1981
  5. H. Samet, The Design and Analysis of Spatial Data Structures, Addision-Wesley, Reading, MA, 1990
  6. M. A. Nascimento and J. R. O. Silva, 'Towards historical R-trees,' ACM symposium on Applied Computing, pp. 235-240, 1998
  7. R. Bliujute, C. S. Jensen, S. Saltenis, and G. Slivinskas, 'R-tree based indexing of now-relative bitemporal data,' Proc. of Inn ConE. on Very Large Data Bases, pp. 345-356, 1998
  8. 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. , pp. 332-331, 1990
  9. 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