skip to main content
10.1145/2486767.2486768acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Don't match twice: redundancy-free similarity computation with MapReduce

Published:23 June 2013Publication History

ABSTRACT

To improve the effectiveness of pair-wise similarity computation, state-of-the-art approaches assign objects to multiple overlapping clusters. This introduces redundant pair comparisons when similar objects share more than one cluster. We propose an approach that eliminates such redundant comparisons and that can be easily integrated into existing MapReduce implementations. We evaluate the approach on a real cloud infrastructure and show its effectiveness for all degrees of redundancy.

References

  1. R. Baraglia, G. D. F. Morales, and C. Lucchese. Document Similarity Self-Join with MapReduce. In ICDM, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. P. Christen. A Survey of Indexing Techniques for Scalable Record Linkage and Deduplication. IEEE Trans. Knowl. Data Eng., 24(9), 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. Ekanayake, T. Gunarathne, and J. Qiu. Cloud Technologies for Bioinformatics Applications. IEEE Trans. Parallel Distrib. Syst., 22(6), 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. T. Elsayed, J. J. Lin, and D. W. Oard. Pairwise Document Similarity in Large Collections with MapReduce. In ACL (Short Papers), 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. L. Kolb, A. Thor, and E. Rahm. Dedoop: Efficient Deduplication with Hadoop. PVLDB, 5(12), 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. L. Kolb, A. Thor, and E. Rahm. Load Balancing for MapReduce-based Entity Resolution. In ICDE, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. L. Kolb, A. Thor, and E. Rahm. Multi-pass Sorted Neighborhood Blocking with MapReduce. Computer Science - R&D, 27(1), 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. H. Köpcke and E. Rahm. Frameworks for entity matching: A comparison. Data Knowl. Eng., 69(2), 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. N. McNeill, H. Kardes, and A. Borthwick. Dynamic Record Blocking: Efficient Linking of Massive Databases in MapReduce. In QDB, 2012.Google ScholarGoogle Scholar
  10. M. Mendes and L. Sacks. Evaluating fuzzy clustering for relevance-based information access. In IEEE FUZZ, volume 1, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  11. C. Moretti, H. Bui, K. Hollingsworth, et al. All-Pairs: An Abstraction for Data-Intensive Computing on Campus Grids. IEEE Trans. Parallel Distrib. Syst., 21(1), 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. G. Papadakis, E. Ioannou, C. Niederée, et al. Eliminating the Redundancy in Blocking-based Entity Resolution Methods. In JCDL, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. G. Papadakis and W. Nejdl. Efficient Entity Resolution for Large Heterogeneous Information Spaces. In ICDE Workshops, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. M. C. Schatz. CloudBurst: highly sensitive read mapping with MapReduce. Bioinformatics, 25(11), 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. R. Vernica, M. J. Carey, and C. Li. Efficient parallel set-similarity joins using MapReduce. In Sigmod, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. C. Xiao, W. Wang, X. Lin, et al. Efficient Similarity Joins for Near-Duplicate Detection. In WWW, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Don't match twice: redundancy-free similarity computation with MapReduce

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          DanaC '13: Proceedings of the Second Workshop on Data Analytics in the Cloud
          June 2013
          49 pages
          ISBN:9781450322027
          DOI:10.1145/2486767

          Copyright © 2013 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 23 June 2013

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          DanaC '13 Paper Acceptance Rate9of16submissions,56%Overall Acceptance Rate19of34submissions,56%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader