(A)kNN query processing on the cloud: A survey

8Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A k-nearest neighbor (kNN) query determines the k nearest points, using distance metrics, from a given 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. Although (A)kNN is a fundamental query type, it is computationally very expensive. During the last years a multiplicity of research papers has focused around the distributed (A)kNN query processing on the cloud. This work constitutes a survey of research efforts towards this direction. The main contribution of this work is an up-to-date review of the latest (A)kNN query processing approaches. Finally, we discuss various research challenges and directions of further research around this domain.

Cite

CITATION STYLE

APA

Nodarakis, N., Rapti, A., Sioutas, S., Tsakalidis, A. K., Tsolis, D., Tzimas, G., & Panagis, Y. (2017). (A)kNN query processing on the cloud: A survey. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10230 LNCS, pp. 26–40). Springer Verlag. https://doi.org/10.1007/978-3-319-57045-7_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free