본문 바로가기
  • Home

On the performance of the hash based indexes for storing the position information of moving objects

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2006, 11(6), pp.8-18
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Bonggi Jun 1

1신라대학교

Candidate

ABSTRACT

Moving objects database systems manage a set of moving objects which changes its locations and directions continuously. The traditional spatial indexing scheme is not suitable for the moving objects because it aimed to manage static spatial data. Because the location of moving object changes continuously, there is problem that expense that the existent spatial index structure reconstructs index dynamically is overladen. In this paper, we analyzed the insertion/deletion costs for processing the movement of objects. The results of our extensive experiments show that the Dynamic Hashing Index outperforms the original R-tree and the fixed grid typically by a big margin.

Citation status

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