[1] |
Bhm 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.
|
[2] |
李朝鹏,李肯立,成运,等. 基于数据预处理的并行分层聚类算法[J]. 计算机应用研究, 2010,27(1):71-73.
|
[3] |
Lee K H, Lee Y J, Choi H, et al. Parallel data processing with MapReduce: A survey[J]. ACM SIGMOD Record,
|
20 |
12,40(4):11-20.
|
[4] |
Corral 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.
|
[5] |
Pereira J C, Lobo F G. An optimized divide-and-conquer algorithm for the closest-pair problem in the planar
|
|
case[J]. Journal of Computer Science and Technology, 2012,27(4):891-896.
|
[6] |
Yang 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,
|
20 |
11,12(3):435-442.
|
[7] |
Salowe J S. Enumerating interdistances in space[J]. International Journal of Computational Geometry &
|
|
Applications, 1992,2(1):49-59.
|
[8] |
Lenhof 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.
|
[9] |
Katoh 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.
|
[10] |
Qi 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.
|
[11] |
卢鑫,陈华辉,董一鸿,等. MapReduce框架下的不确定数据Top-k查询计算[J]. 模式识别与人工智能, 2013,26(7):695-704.
|
|
|
[12] |
黄山. 基于Map-Reduce框架云环境时空查询技术研究与实现[D]. 沈阳:东北大学, 2011.
|
[13] |
Xiao Chuan, Wang Wei, Lin Xuemin, et al. Efficient similarity joins for near-duplicate detection[J]. ACM
|
|
Transactions on Database Systems(TODS), 2011,36(3):No. 15.
|
[14] |
Vernica R, Carey M J, Li Chen. Efficient parallel set-similarity joins using MapReduce[C]// Proceedings
|
|
of the 2010 ACM SIGMOD International Conference on Management of data. 2010:495-506.
|
[15] |
Merigó J M, Gil-Lafuente A M. Using the OWA operator in the Minkowski distance[J]. International Journal
|
|
of Computer Science, 2008,3(3):149-157.
|
[16] |
Kim Y, Shim K. Parallel Top-k similarity join algorithms using MapReduce[C]// 2012 IEEE 28th
|
|
International Conference on Data Engineering (ICDE). 2012:510-521.
|
[17] |
段松青,吴斌,于乐,等. PDM: 基于Hadoop的并行数据分析系统[J]. 湖南大学学报(自然科学版), 2012,39(10):87-
|
|
92.
|
[18] |
Palmer C R, Faloutsos C. Density biased sampling: An improved method for data mining and clustering
|
[C] |
//Proceedings of the 2000 ACM SIGMOO International Conference on Management of Data. 2000:82-92.
|
[19] |
UCSB. Datadownload[EB/OL]. http://vision.ece.ucsb.edu/download.html, 2014-04-25.
|