Proceedings of the Korea Information Processing Society Conference (한국정보처리학회:학술대회논문집)

  • 2008.11a
  • /
  • Pages.878-881
  • /
  • 2008
  • /
  • 2005-0011(pISSN)
  • /
  • 2671-7298(eISSN)
Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Rend 3D R-tree: An Improved Index Structure in Moving Object Database Based on 3D R-tree

Rend 3D R-tree : 3D R-tree 기반의 이동 객체 데이터베이스 색인구조 연구

  • Ren XiangChao (Dept. of Automation, Chongqing University of Posts and Telecommunication) ;
  • Kee-Wook Rim (Dept. of Computer Science, Sun Moon University) ;
  • Nam Ji Yeun (Dept. of Computer Science, Sun Moon University) ;
  • Lee KyungOh (Dept. of Computer Science, Sun Moon University)
  • 임향초 (중경우전대학 자동화학과) ;
  • 임기욱 (선문대학교 전자계산학과) ;
  • 남지은 (선문대학교 전자계산학과) ;
  • 이경오 (선문대학교 전자계산학과)
  • Published : 2008.11.14
Download PDF
⟨ Previous Next ⟩

Abstract

To index the object's trajectory is an important aspect in moving object database management. This paper implements an optimizing index structure named Rend 3D R-tree based on 3D R-Tree. This paper demonstrates the time period update method to reconstruct the MBR for the moving objects in order to decrease the dead space that is produced in the closed time dimension of the 3D R-tree, then a rend method is introduced for indexing both current data and history data. The result of experiments illustrates that given methods outperforms 3D R-Tree and LUR tree in query processes.

Keywords

Acknowledgement

This research was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute of Information Technology Advancement) (IITA-2007-C1090-0701-0020)