A Partitioning GPU-based Algorithm for Processing the k Nearest-Neighbor Query

Abstract

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 memory accessed by CPUs, thus, providing higher computing power. We propose and implement a new GPU-based partitioning algorithm for the k-NN query, using the CUDA runtime API. Due to partitioning, this algorithm avoids calculating distances for the whole dataset. Using synthetic and real datasets, we present an extensive experimental performance comparison against six existing algorithms. These algorithms are based on calculating distances for the whole in-memory dataset. This comparison shows that the new algorithm excels in all the conducted experiments and outperforms these six algorithms. © 2020 ACM.