Data Management

K Nearest Neighbor Queries and KNN-Joins in Large Relational Databases (Almost) for Free

Download Now Free registration required

Executive Summary

Finding the k Nearest Neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve these problems focused on spatial databases or standalone systems, where changes to the database engine may be required, which may limit their application on large data sets that are stored in a relational database management system. Furthermore, these methods may not automatically optimize kNN queries or kNN-Joins when additional query conditions are specified.

  • Format: PDF
  • Size: 300.8 KB