본문 바로가기
  • Home

The Performance Analysis of Nearest Neighbor Query Process using Circular Search Distance

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2010, 15(1), pp.83-90
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Seon,Hwijoon 1 김원호 1

1신경대학교

Accredited

ABSTRACT

The number of searched nodes and the computation time in an index should be minimized for optimizing the processing cost of the nearest neighbor query. The Measurement of search distance considered a circular location property of objects is required to accurately select the nodes which will be searched in the nearest neighbor query. In this paper, we propose the processing method of the nearest neighbor query be considered a circular location property of object where the search space consists of a circular domain and show its performance by experiments. The proposed method uses the circular minimum distance and the circular optimal distance which are the search measurements for optimizing the processing cost of the nearest neighbor query.

Citation status

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