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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.664.379

H. Kriegel and T. Seidl, Approximation-based similarity search for 3-D surface segments, 1998.

X. Bai, R. Guerraoui, A. Kermarrec, and V. Leroy, Collaborative personalized top-k processing, ACM Transactions on Database Systems, vol.36, issue.4, 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, SIGMOD Rec, 1997.
DOI : 10.1145/253260.253264
URL : http://arxiv.org/abs/cs/9809023

R. Agrawal, C. Faloutsos, and A. N. Swami, Efficient similarity search in sequence databases, Foundations of Data Organization and Algorithms, 1993.
DOI : 10.1007/3-540-57301-1_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.5983

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), 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, VLDB'96, 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. Ohm and F. Krebs, The k-nearest neighbour join: Turbo charging the kdd process, Knowl. Inf. Syst, vol.6, issue.6, pp.728-749, 2004.

P. Ciaccia, M. Patella, and P. Zezula, M-tree: An efficient access method for similarity search in metric spaces, VLDB'97, 1997.

C. Yu, R. Zhang, Y. Huang, and H. Xiong, High-dimensional kNN joins with incremental updates, GeoInformatica, vol.49, issue.4, 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, 1975.
DOI : 10.1145/361002.361007

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

G. Song, J. Rochas, F. Huet, and F. Magouì-es, Solutions for Processing K Nearest Neighbor Joins for Massive Data on MapReduce, 2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, 2015.
DOI : 10.1109/PDP.2015.79
URL : https://hal.archives-ouvertes.fr/hal-01097337

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

L. Jiang, Z. Cai, D. Wang, and S. Jiang, Survey of improving knearest-neighbor for classification, Fuzzy Systems and Knowledge Discovery, 2007.

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

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

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

C. Ji, T. Dong, Y. Li, Y. Shen, K. Li et al., Inverted Grid-Based kNN Query Processing with MapReduce, 2012 Seventh ChinaGrid Annual Conference, pp.25-32, 2012.
DOI : 10.1109/ChinaGrid.2012.19

A. Gionis, P. Indyk, and R. Motwani, Similarity search in high dimensions via hashing, VLDB'99, 1999.

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), 2010.
DOI : 10.1109/ICDE.2010.5447837
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.753

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
URL : http://doi.org/10.1371/journal.pone.0044000

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, WebDB'08, 2008.

A. Stupar, S. Michel, and R. Schenkel, Rankreduce -processing k-nearest 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, 2012.
DOI : 10.14778/2336664.2336674
URL : http://arxiv.org/abs/1207.0141

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, 2012.
DOI : 10.1145/2247596.2247602

M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, Localitysensitive hashing scheme based on p-stable distributions, Symposium on Computational Geometry, 2004.
DOI : 10.1145/997817.997857
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.8167

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, 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, 1998.
DOI : 10.1007/3-540-63238-7_30

Q. Du and X. Li, A novel KNN join algorithms based on Hilbert R-tree in MapReduce, Proceedings of 2013 3rd International Conference on Computer Science and Network Technology, pp.417-420, 2013.
DOI : 10.1109/ICCSNT.2013.6967143

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

M. Slaney and M. Casey, Locality-Sensitive Hashing for Finding Nearest Neighbors [Lecture Notes], IEEE Signal Processing Magazine, vol.25, issue.2, pp.128-131, 2008.
DOI : 10.1109/MSP.2007.914237

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

H. Bay, T. Tuytelaars, and L. Van-gool, Surf: Speeded up robust features, ECCV'06, 2006.
DOI : 10.1007/11744023_32
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.679.3046

W. Dong, Z. Wang, W. Josephson, M. Charikar, and K. Li, Modeling LSH for performance tuning, Proceeding of the 17th ACM conference on Information and knowledge mining, CIKM '08, pp.669-678, 2008.
DOI : 10.1145/1458082.1458172
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.4629