본문 바로가기
  • Home

K-Nearest Neighbor Query processing in Multi-Dimensional Indexing Structures

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2005, 10(1), pp.85-91
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Byung-Gon Kim 1 OH Sung-Kyun 2

1부천대학교
2서일대학

Candidate

ABSTRACT

Recently, query processing techniques for the multi-dimensional data like images have been widely used to perform content-based retrieval of the data. Range Quesy and Nearest neighbor query are widly used multi dimensional queries. This paper proposes the efficient pruning strategies for k-nearest neighbor query in R-tree variants indexing structures. Pruning strategy is important for the multi-dimensional indexing query processing so that search space can be reduced. We analyzed the pruning strategies and perform experiments to show overhead and the profit of the strategies. Finally, we propose best use of the strategies.

Citation status

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