본문 바로가기
  • Home

A Spatial Index Compression Scheme Using Semi-Approximation

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

Jong Wan Kim 1

1고려대학교

Candidate

ABSTRACT

Over the last several years, studies on spatial index have increased in proportion to the increase in the spatial data. Most of these studies, however, were on the indices based on R-tree by adding or changing some options, and there are a few studies on how to increase the search performance of the spatial data by compressing an MBR. This study was conducted in order to propose a new MBR compression scheme, SA(Semi- Approximation). The basic idea of this paper is the compression of MBRs in a spatial index. Since SA decreases the keys of MBRs, the enlargements of QMBR in half and increases the utilization of nodes, the SA heightens the overall search performance. The study analyzes mathematically the number of node accesses in a 2D space and evaluates the performance of the SA using the real data on location information. The results show that the proposed scheme has increased performance, higher than that of the pre-established schemes on compression of MBR.

Citation status

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