2Bhm C, Braunmüller B, Krebs F, et al. Epsilon grid order: An algorithm for the similarity join on massive high-dimensional data[J]. ACM SIGMOD Record, 2001,30(2):379-388.
3Lee K H, Lee Y J, Choi H, et al. Parallel data processing with MapReduce: A survey[J]. ACM SIGMOD Record,2012,40(4):11-20.
4Corral A, Manolopoulos Y, Theodoridis Y, et al. Algorithms for processing K-closest-pair queries in spatial databases [J]. Data & Knowledge Engineering, 2004,49(1):67-104.
5Yang S W, Choi Y, Jung C K. A divide-and-conquer delaunay triangulation algorithm with a vertex array and flip operations in two-dimensional space[J]. International Journal of Precision Engineering and Manufacturing,2011,12(3):435-442.
6Salowe J S. Enumerating interdistances in space[J]. International Journal of Computational Geometry &Applications, 1992,2(1):49-59.
7Lenhof H P, Smid M. Sequential and parallel algorithms for the k closest pairs problem [J]. International Journal of Computational Geometry & Applications, 1995,5(3):273-288.
8Katoh N, Iwano K. Finding k farthest pairs and k closest farthest bichromatic pairs for points in the plane C]// Proceedings of the 8th Annual Symposium on Computational Geometry. 1992:320-329.
9Qi Shuyao, Bouros P, Mamoulis N. Efficient Top-k spatial distance joins [C]// Proceedings of the 13th International Conference on Advances in Spatial and Temporal Databases. 2013:1-18.
