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 data types you are using must be set up for it. For example, the Informix® spatial solution provides nearest-neighbor search support.

Perform nearest-neighbor searches explains how to perform nearest-neighbor searches using data types that support this feature.

Set 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.