Multi-Dimensional Vector Approximation Tree with Dynamic Bit Allocation

동적 비트 할당을 통한 다차원 벡터 근사 트리

  • 복경수 (충북대학교 정보통신공학과) ;
  • 허정필 (매크로임팩트(주) 시스템 소프트웨어연구소) ;
  • 유재수 (충북대학교 정보통신공학과)
  • Published : 2004.09.01


Recently, It has been increased to use a multi-dimensional data in various applications with a rapid growth of the computing environment. In this paper, we propose the vector approximate tree for content-based retrieval of multi-dimensional data. The proposed index structure reduces the depth of tree by storing the many region information in a node because of representing region information using space partition based method and vector approximation method. Also it efficiently handles 'dimensionality curse' that causes a problem of multi-dimensional index structure by assigning the multi-dimensional data space to dynamic bit. And it provides the more correct regions by representing the child region information as the parent region information relatively. We show that our index structure outperforms the existing index structure by various experimental evaluations.


Dimensionality Curse;Vector Approximation Tree;Similarity Search;Multi-Dimensional Data