본문 바로가기
  • Home

A Study on Indexing Moving Objects using the 3D R-tree

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2005, 10(4), pp.65-75
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Bonggi Jun 1

1신라대학교

Candidate

ABSTRACT

Moving-objects databases should efficiently support database queries that refer to the trajectories and positions of continuously moving objects. To improve the performance of these queries, an efficient indexing scheme for continuously moving objects is required. To my knowledge, range queries on current positions cannot be handled by the 3D R-tree and the TB-tree. In order to handle range queries on current and past positions, I modified the original 3D R-tree to keep the now tags. Most of spatio-temporal index structures suffer from the fact that they cannot efficiently process range queries past positions of moving objects. To address this issue, we propose an access method, called the Tagged Adaptive 3DR-tree (or just TA3DR-tree), which is based on the original 3D R-tree method. The results of our extensive experiments show that the Tagged Adaptive 3DR-tree outperforms the original 3D R-tree and the TB-tree typically by a big margin.

Citation status

* References for papers published after 2022 are currently being built.