Nearest-Neighbor Searching

The R-tree access method provides support for nearest-neighbor searches, that is, querying for objects in a spatial database that are closest to a specified object or location. Traditionally, without nearest-neighbor support, these kinds of searches are awkward to perform and involve several iterative stages.

To perform nearest-neighbor searches, the DataBlade module you are using must be set up for it. For example, the IBM Informix Geodetic DataBlade module and the IBM Informix Spatial DataBlade module both provide nearest-neighbor search support.

Performing Nearest-Neighbor Searches explains how to perform nearest-neighbor searches using a DataBlade module that provides this feature.

Setting Up Nearest-Neighbor Searching explains how to add nearest-neighbor support to a DataBlade module.

In this release, nearest-neighbor search is not supported with fragmented indexes.