An Extended R-Tree Indexing Method using Prefetching in Main Memory

메인 메모리에서 선반입을 사용한 확장된 R-Tree 색인 기법

  • 강홍구 (건국대학교 컴퓨터공학과 대학원) ;
  • 김동오 (건국대학교 컴퓨터공학과 대학원) ;
  • 홍동숙 (건국대학교 컴퓨터공학과 대학원) ;
  • 한기준 (건국대학교 컴퓨터공학과)
  • Published : 2004.06.30

Abstract

Recently, studies have been performed to improve the cache performance of the R-Tree in main memory. A general mothed to improve the cache performance of the R-Tree is to reduce size of an entry so that a node can store more entries and fanout of it can increase. However, this method generally requites additional process to reduce information of entries and do not support incremental updates. In addition, the cache miss always occurs on moving between a parent node and a child node. To solve these problems efficiently, this paper proposes and evaluates the PR-Tree that is an extended R-Tree indexing method using prefetching in main memory. The PR-Tree can produce a wider node to optimize prefetching without additional modifications on the R-Tree. Moreover, the PR-Tree reduces cache miss rates that occur in moving between a parent node and a child node. In our simulation, the search performance, the update performance, and the node split performance of the PR-Tree improve up to 38%. 30%, and 67% respectively, compared with the original R-Tree.