2010 | OriginalPaper | Buchkapitel
Optimizing All-Nearest-Neighbor Queries with Trigonometric Pruning
verfasst von : Tobias Emrich, Franz Graf, Hans-Peter Kriegel, Matthias Schubert, Marisa Thoma
Erschienen in: Scientific and Statistical Database Management
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Many applications require to determine the
k
-nearest neighbors for multiple query points simultaneously. This task is known as all-(
k
)-nearest- neighbor (A
k
NN) query. In this paper, we suggest a new method for efficient A
k
NN 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 A
k
NN queries.