Algorithms for processing the group K nearest-neighbor query on distributed frameworks

Volume: 39, Issue: 3, Pages: 733 - 784
Published: Nov 9, 2020
Abstract
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 has been studied during the recent years and several performance improving techniques and pruning heuristics have been proposed. In previous work, we presented the first MapReduce algorithm, consisting of alternating local and...
Paper Details
Title
Algorithms for processing the group K nearest-neighbor query on distributed frameworks
Published Date
Nov 9, 2020
Volume
39
Issue
3
Pages
733 - 784
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.