Browse > Article

A Node Relocation Strategy of Trajectory Indexes for Efficient Processing of Spatiotemporal Range Queries  

Lim Duksung (영진전문대학 컴퓨터정보기술계열)
Cho Daesoo (동서대학교 인터넷공학부)
Hong Bonghee (부산대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Databases / v.31, no.6, 2004 , pp. 664-674 More about this Journal
Abstract
The trajectory preservation property that stores only one trajectory in a leaf node is the most important feature of an index structure, such as the TB-tree for retrieving object's moving paths in the spatio-temporal space. It performs well in trajectory-related queries such as navigational queries and combined queries. But, the MBR of non-leaf nodes in the TB-tree have large amounts of dead space because trajectory preservation is achieved at the sacrifice of the spatial locality of trajectories. As dead space increases, the overlap between nodes also increases, and, thus, the classical range query cost increases. We present a new split policy and entry relocation policies, which have no deterioration of the performance for trajectory-related queries, for improving the performance of range queries. To maximally reduce the dead space of a non-leaf node's MBR, the Maximal Area Reduction (MAR) policy is used as a split policy for non-leaf nodes. The entry relocation policy induces entries in non-leaf nodes to exchange each other for the purpose of reducing dead spaces in these nodes. We propose two algorithms for the entry relocation policy, and evaluate the performance studies of new algorithms comparing to the TB-tree under a varying set of spatio-temporal queries.
Keywords
spatio-temporal database; trajectory indexing; trajectory-based query;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Hongjun Zhu, Jianwen Su, and Oscar H. Ibarra, 'Trajectory queries and octagons in moving object databases,' In Proc. of CIKM, pp. 413-421, 2002   DOI
2 V. Prasad Chakka, Adam Everspaugh, and Jignesh M. Patel, 'Indexing Large Trajectory Data Sets with SETI,' In Proc. of CIDR, 2003
3 Dieter Pfoser, 'Indexing the Trajectories of Moving Objects,' IEEE Data Eng. Bull. Vol.25, No.2, pp.3-9, 2002
4 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
5 Theoderidis, Y.; Vazirgiannis, M.; Sellis, T., 'Spatio-temporal indexing for large multimedia applications,' In Proc. of IEEE Multimedia Computing and Systems, pp.441-448, 1996   DOI
6 Anil Kumar, Vassilis J. Tsotras, and Christos Faloutsos, 'Designing Access Methods for Bitemporal Databases,' TKDE, Vol.10, No.1, pp.1-20, 1998   DOI   ScienceOn
7 N. Beckmann and H. P. Kriegel, 'The R*-tree: An Efficient and Robust Access Method for Points and Rectangles,' In Proc. of ACM SIGMOD, pp.332-331, 1990   DOI
8 David B. Lomet and Betty Salzberg, 'Access Methods for Multiversion Data,' In Proc. of SIGMOD, pp.315-324, 1989   DOI
9 Peter J. Varman and Rakesh M. Verma, 'An Efficient Multiversion Access Structure,' TKDE, Vol.9, No.3, pp.391-409, 1997   DOI   ScienceOn
10 Yufei Tao and Dimitris Papadias, 'MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries,' In Proc. of VLDB, pp.431-440, 2001
11 Bruno Becker, Stephan Gschwind, Thomas Ohler, Bernhard Seeger, and Peter Widmayer, 'On Optimal Multiversion Access Structures,' In Proc. of SSD, pp.123-141, 1993
12 Dieter Pfoser, Christian S. Jensen, and Yannis Theodoridis, 'Novel Approaches in Query Processing for Moving Object Trajectories,' In Proc. of VLDB, pp. 395-406, 2000
13 Yufei Tao, Dimitris Papadias, Jun Zhang, 'Cost models for overlapping and multi version structures,' ACM Trans. Database Syst., Vol.27, No.3, pp.299-342, 2002   DOI   ScienceOn
14 M. Hadjieleftheriou, G. Kollios, V. J. Tsotras, and D. Gunopulos, 'Efficient Indexing of Spatiotemporal Objects,' In Proc. of EDBT, pp. 251-268, 2002
15 Antonin Guttman, 'R-Trees: A Dynamic Index Structure for Spatial Searching,' In Proc. of SIGMOD, pp. 47-57, 1984   DOI