Efficient parallel kNN joins for large data in MapReduce
Authors:
Top Cited Papers
Open Access
- 27 March 2012
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 38-49
Abstract
No abstract availableFunding Information
- Division of Information and Intelligent Systems (IIS-1212310IIS-1200792)
This publication has 18 references indexed in Scilit:
- Llama2011
- RanKloud2011
- Efficient B-tree based indexing for cloud data processingProceedings of the VLDB Endowment, 2010
- K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free2010
- Spatial Queries Evaluation with MapReduce2009
- High-dimensional kNN joins with incremental updatesGeoInformatica, 2009
- SJMR: Parallelizing spatial join with MapReduce on clusters2009
- Efficient index-based KNN join processing for high-dimensional dataInformation and Software Technology, 2007
- Distributed computation of the knn graph for large high-dimensional point setsJournal of Parallel and Distributed Computing, 2007
- The k-Nearest Neighbour Join: Turbo Charging the KDD ProcessKnowledge and Information Systems, 2004