Πλοήγηση ανά Θέμα "K nearest neighbor queries"
Αποτελέσματα 1-4 από 4
-
Algorithms for processing the group K nearest-neighbor query on distributed frameworks
(2021)Given two datasets of points (called Query and Training), the Group (K) Nearest-Neighbor (GKNN) query retrieves (K) points of the Training with the smallest sum of distances to every point of the Query. This spatial query ... -
GPU-Based Algorithms for Processing the k Nearest-Neighbor Query on Disk-Resident Data
(2021)Algorithms for answering the k Nearest-Neighbor (k-NN) query are widely used for queries in spatial databases and for distance classification of a group of query points against a reference dataset to derive the dominating ... -
An Improved GPU-based Algorithmfor Processing the k Nearest Neighbor Query
(2020)The k Nearest Neighbor (k-NN) query is a common spatial query that appears in several big data applications. We propose and implement a new GPU-based algorithm for the k-NN query, which improves our previous Symmetric ... -
A Partitioning GPU-based Algorithm for Processing the k Nearest-Neighbor Query
(2020)The k Nearest-Neighbor (k-NN) query is a common spatial query that appears in several big data applications. Typically, GPU devices have much larger numbers of processing cores than CPUs and faster device memory than main ...