Association for Computing Machinery
A k-Nearest Neighbor (kNN) query determines the k nearest points, using distance metrics, from a specific location. An all k-Nearest Neighbor (AkNN) query constitutes a variation of a kNN query and retrieves the k nearest points for each point inside a database. Their main usage resonates in spatial databases and they consist the backbone of many location-based applications and not only (i.e. kNN joins in databases, classification in data mining). So, it is very crucial to develop methods that answer them efficiently. In this paper, the authors propose a novel method for classifying multidimensional data using an AkNN algorithm in the MapReduce framework.