Parallel top-K similarity join algorithms using MapReduce

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2012, Pages 510-521

  Kim, Younghoon ^a   Shim, Kyuseok ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-BOUND ALGORITHMS; DATA-INTENSIVE APPLICATION; DIVIDE AND CONQUER; LARGE CLUSTERS; MAP-REDUCE; PARALLEL EXECUTIONS; PARTITIONING METHODS; PERFORMANCE STUDY; REAL LIFE DATASETS; SIMILARITY JOIN;

DATA TRANSFER;

ALGORITHMS;

EID: 84864248187     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2012.87     Document Type: Conference Paper

References (30)

1. C. Böhm, B. Braunmüller, F. Krebs, and H.-P. Kriegel, "Epsilon grid order: An algorithm for the similarity join on massive high-dimensional data," in SIGMOD, 2001.
2. H. V. Jagadish, "A retrieval technique for similar shapes," in SIGMOD, 1991.
3. D. Faloutsos, R. Barber, M. Flickner, and J. Hafner, "Efficient and effective querying by image content," Journal of Intelligent Information Systems, vol. 3, 1994.
4. H.-P. Kregel and T. Seidl, "Approximation-based similarity search for 3-d surface segments," GeoInformatica, 1998.
5. F. Korn, N. Sidiropoulos, C. Faloutsos, E. Siegel, and Z. Protopapas, "Fast nearest neighbor search in medical image databases," in VLDB, 1996.
6. R. Agrawal, C. Faloutsos, and A. N. Swami, "Efficient similarity search in sequence databases," in FODO, 1993.
7. C. Böhm and F. Krebs, "Supporting kdd applications by the k-nearest neighbor join," in DEXA, 2003.
8. A. Jain and R. Dubes, Algorithms for Clustering Data. Prentice Hall, 1988.
9. C. Xiao, W. Wang, X. Lin, and J. X. Yu, "Efficient similarity joins for near duplicate detection," in WWW, 2008.
10. J. Dean and S. Ghemawat, "Mapreduce: Simplified data processing on large clusters," in OSDI, 2004.
11. Apache, "Hadoop," http://hadoop.apache.org, 2010.
12. A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos, "Algorithms for processing k-closest-pairs queries in spatial databases," Data & Knowledge Engineering, 2004.
13. R. Vernica, M. J. Carey, and C. Li, "Efficient parallel set-similarity joins using mapreduce," in SIGMOD, 2010.
14. M. I. Shamos and D. J. Hoey, "Closest-point problem," in Symposium on Foundations of Coputer Science, 1975.
15. J. L. Bentley and M. I. Shamos, "Divide-and-conquer in multidimensional space," in 8th Annual ACM Symposium on the Theory of Computing, 1976.
16. J. S. Salowe, "Enumerating interdistances in space," Journal of Computational Geometry and Applications, 1991.
17. H. P. Lenhof and M. Smid, "Sequential and parallel algorithms for the k closest pairs problem," Journal of Computational Geometry and Applications, 1995.
18. N. Katoh and K. Iwano, "Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane," in 8th Annual Computational Geometry, 1992.
19. M. Zhu, D. Papadias, J. Zhang, and D. L. Lee, "Top-k spatial joins," TKDE, vol. 17, no. 4, 2005.
20. M. A. Lopez and S. Liao, "Finding k-closest-pairs efficiently for high dimensional data," in 12th Canadian Conference on Computational Geometry, 2000.
21. R. J. Bayardo, Y. Ma, and R. Srikant, "Scaling up all pairs similarity search," in WWW, 2007.
22. S. Chaudhuri, V. Ganti, and R. Kaushik, "A primitive operator for similarity joins in data cleaning," in ICDE, 2006.
23. S. Sarawagi and A. Kirpal, "Efficient set joins on similarity predicates," in SIGMOD, 2004.
24. S. Santini and R. Jain, "Similarity measures," IEEE Trans. Pattern Anal. Mach. Intell., 1999.
25. S. Suri, "Closest pair," http://www.cs.ucsb.edu/~suri/, 2002.
26. L. Monier, "Combinatorial solutions of multidimensional divide-andconquer recurrences," Journal of Algorithms, 1980.
27. R. Fagin, A. Lotem, and M. Naor, "Optimal aggregation algorithms for middleware," Journal of Computer and System Sciences, 2003.
28. Wikipedia, "Lagrange multipliers," http://en.wikipedia.org/, 2010.
29. C. R. Palmer and C. Faloutsos, "Density biased sampling: an improved method for data mining and clustering," SIGMOD Rec., 2000.
30. UCSB, "Data download," http://vision.ece.ucsb.edu/download. html, 2010.