Data Management

VoRTree: Rtrees With Voronoi Diagrams for Efficient Processing of Spatial Nearest Neighbor Queries

Free registration required

Executive Summary

A very important class of spatial queries consists of Nearest-Neighbor (NN) query and its variations. Many studies in the past decade utilize R-trees as their underlying index structures to address NN queries efficiently. The general approach is to use R-tree in two phases. First, R-tree's hierarchical structure is used to quickly arrive to the neighborhood of the result set. Second, the R-tree nodes intersecting with the local neighborhood (Search Region) of an initial answer are investigated to find all the members of the result set.

  • Format: PDF
  • Size: 1491.1 KB