Acknowledgement
Supported by : 한국연구재단
References
- J. Dean and S. Ghemawat, "MapReduce: Simplified data processing on large clusters," Communications of the ACM, Vol. 51, No. 1, pp. 107-113, 2008. https://doi.org/10.1145/1327452.1327492
- D. Jiang, BC. Ooi, L. Shi and S. Wu, "The performance of MapReduce: An in-depth study," Proc. of the VLDB Endowment, Vol. 3.1-2, pp. 472-483, 2010.
- JA. Hartigan and MA. Wong, "Algorithm AS 136: A k-means Clustering Algorithm," Applied Statistics, pp. 100-10, 1979.
- X. Jin, and J. Han, "K-Medoids Clustering," Encyclopedia of Machine Learning, Springer US, pp. 564-565, 2010.
- C. Bohm and HP. Kriegel, "A cost model and index architecture for the similarity join," ICDE 2001, pp. 411-420, 2001.
- C. Xia, H. Lu, BC. Ooi, and J. Hu, "Gorder: An efficient method for knn join processing," VLDB 2004, pp. 756-767, 2004.
- C. Yu, B. Cui, S. Wang, and J. Su, "Efficient indexbased knn join processing for high-dimensional data," Information and Software Technology, Vol. 49, No. 4, pp. 332-344, 2007. https://doi.org/10.1016/j.infsof.2006.05.006
- B. Yao, F. Li, and P. Kumar, "K nearest neighbor queries and knn-joins in large relational databases (almost) for free," ICDE 2010, pp. 4-15, 2010.
- W. Lu, Y. Shen, Y. Chen, and BC. Ooi, "Efficient processing of k nearest neighbor joins using Map-Reduce," Proc. of the VLDB Endowment, Vol. 5, No. 10, pp. 1016-1027, 2012.