본문 바로가기
  • Home

A Voronoi Diagram-Based Grid Structure for Efficient Nearest Neighbor Query Processing

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

권동섭 1

1명지대학교

Accredited

ABSTRACT

Nearest-neighbor searches are essential operations in various applications such as multimedia systems and GIS systems. Although numbers of research works for nearest-neighbor search have been proposed, they have a limitation on the performance since they process queries on the fly with indexes on data. This paper proposes a new nearest-neighbor search algorithm based on a grid-based data structure, which preprocesses and stores the result of nearest-neighbor queries using Voronoi diagrams over static data. While traditional techniques try to index data itself, the proposed technique attempts to index the result of the queries. Therefore, it performs nearest-neighbor queries more efficiently.

Citation status

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