Optimizing All-Nearest-Neighbor Queries with Trigonometric Pruning

Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper, we suggest a new method for efficient AkNN query processing which is based on spherical approximations for indexing and query set representation. In this setting, we propose trigonometric pruning which enables a significant decrease of the remaining search space for a query. Employing this new pruning method, we considerably speed up AkNN queries.

• Type: Conference
• Year: 2010
• Where: SSDBM
• Authors: Tobias Emrich, Franz Graf, Hans-Peter Kriegel, Matthias Schubert, Marisa Thoma
• Keywords: AkNN Query Processing, Database, Multiple Query Points, Query Set Representation, SSDBM 2010