D. Li, Q. Chen, and C. Tang, Motion-Aware KNN Laplacian for Video Matting, 2013 IEEE International Conference on Computer Vision, 2013.
DOI : 10.1109/ICCV.2013.447

H. Kriegel and T. Seidl, Approximation-based similarity search for 3-d surface segments, Geoinformatica, vol.2, issue.2, pp.113-147, 1998.
DOI : 10.1023/A:1009760031965

X. Bai, R. Guerraoui, A. Kermarrec, and V. Leroy, Collaborative personalized top-k processing, ACM Transactions on Database Systems, vol.36, issue.4, pp.1-2638, 2011.
DOI : 10.1145/2043652.2043659
URL : https://hal.archives-ouvertes.fr/hal-00652036

D. Rafiei and A. Mendelzon, Similarity-based queries for time series data, ACM SIGMOD Record, vol.26, issue.2, pp.13-25, 1997.
DOI : 10.1145/253262.253264

R. Agrawal, C. Faloutsos, and A. N. Swami, Efficient similarity search in sequence databases, Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms, ser. FODO '93, pp.69-84, 1993.
DOI : 10.1007/3-540-57301-1_5

K. Inthajak, C. Duanggate, B. Uyyanonvara, S. Makhanov, and S. Barman, Medical image blob detection with feature stability and KNN classification, 2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE), pp.128-131, 2011.
DOI : 10.1109/JCSSE.2011.5930107

F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas, Fast nearest neighbor search in medical image databases, Proceedings of the 22th International Conference on Very Large Data Bases, ser. VLDB '96, pp.215-226, 1996.

H. V. Jagadish, B. C. Ooi, K. Tan, C. Yu, and R. Zhang, iDistance, ACM Transactions on Database Systems, vol.30, issue.2, pp.364-397, 2005.
DOI : 10.1145/1071610.1071612

C. Böhm and F. Krebs, The k-Nearest Neighbour Join: Turbo Charging the KDD Process, Knowledge and Information Systems, vol.joins, issue.6, pp.728-749, 2004.
DOI : 10.1007/s10115-003-0122-9

P. Ciaccia, M. Patella, and P. Zezula, M-tree: An efficient access method for similarity search in metric spaces, Proceedings of the 23rd International Conference on Very Large Data Bases, ser. VLDB '97, pp.426-435, 1997.

]. C. Yu, R. Zhang, Y. Huang, and H. Xiong, High-dimensional kNN joins with incremental updates, GeoInformatica, vol.49, issue.4, pp.55-82, 2010.
DOI : 10.1007/s10707-009-0076-5

J. L. Bentley, Multidimensional binary search trees used for associative searching, Communications of the ACM, vol.18, issue.9, pp.509-517, 1975.
DOI : 10.1145/361002.361007

J. Dean and S. Ghemawat, MapReduce, Communications of the ACM, vol.51, issue.1, pp.107-113, 2008.
DOI : 10.1145/1327452.1327492

N. Bhatia and A. Vandana, Survey of nearest neighbor techniques, International Journal of Computer Science and Information Security, vol.8, issue.2, 2010.

L. Jiang, Z. Cai, D. Wang, and S. Jiang, Survey of improving k-nearestneighbor for classification, Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery, pp.679-683, 2007.

C. Yu, R. Zhang, Y. Huang, and H. Xiong, High-dimensional kNN joins with incremental updates, GeoInformatica, vol.49, issue.4, pp.55-82, 2010.
DOI : 10.1007/s10707-009-0076-5

M. I. Andreica and N. T. Apus, Sequential and mapreduce-based algorithms for constructing an in-place multidimensional quad-tree index for answering fixed-radius nearest neighbor queries, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00787796

M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, Localitysensitive hashing scheme based on p-stable distributions, Proceedings of the Twentieth Annual Symposium on Computational Geometry, ser. SCG '04, pp.253-262, 2004.

B. Yao, F. Li, and P. Kumar, K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), pp.4-15, 2010.
DOI : 10.1109/ICDE.2010.5447837

A. S. Arefin, C. Riveros, R. Berretta, and P. Moscato, GPU-FS-kNN: A Software Tool for Fast and Scalable kNN Computation Using GPUs, PLoS ONE, vol.7, issue.8, 2012.
DOI : 10.1371/journal.pone.0044000.s001

D. Novak and P. Zezula, M-Chord, Proceedings of the 1st international conference on Scalable information systems , InfoScale '06, 2006.
DOI : 10.1145/1146847.1146866

P. Haghani, S. Michel, and K. Aberer, Lsh at large ? distributed knn search in high dimensions, 2008.

A. Stupar, S. Michel, and R. Schenkel, Rankreduce -processing knearest neighbor queries on top of mapreduce, LSDS-IR, 2010.

W. Lu, Y. Shen, S. Chen, and B. C. Ooi, Efficient processing of k nearest neighbor joins using MapReduce, Proc. VLDB Endow, pp.1016-1027, 2012.
DOI : 10.14778/2336664.2336674

C. Zhang, F. Li, and J. Jestes, Efficient parallel kNN joins for large data in MapReduce, Proceedings of the 15th International Conference on Extending Database Technology, EDBT '12, pp.38-49, 2012.
DOI : 10.1145/2247596.2247602

M. Bawa, T. Condie, and P. Ganesan, LSH forest, Proceedings of the 14th international conference on World Wide Web , WWW '05, pp.651-660, 2005.
DOI : 10.1145/1060745.1060840

G. Song, Z. Meng, F. Huet, F. Magouì-es, L. Yu et al., A Hadoop MapReduce Performance Prediction Method, 2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing, pp.820-825, 2013.
DOI : 10.1109/HPCC.and.EUC.2013.118
URL : https://hal.archives-ouvertes.fr/hal-00918329

X. Zhou, D. J. Abel, and D. Truffet, Data partitioning for parallel spatial join processing, Geoinformatica, vol.2, issue.2, pp.175-204, 1998.
DOI : 10.1007/3-540-63238-7_30

S. Liao, M. A. Lopez, and S. T. Leutenegger, High dimensional similarity search with space filling curves, Proceedings 17th International Conference on Data Engineering, pp.615-622, 2001.
DOI : 10.1109/ICDE.2001.914876

D. Jiang, B. C. Ooi, L. Shi, and S. Wu, The performance of MapReduce, Proc. VLDB Endow, pp.472-483, 2010.
DOI : 10.14778/1920841.1920903