{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,12]],"date-time":"2026-10-12T23:05:30Z","timestamp":1791846330752,"version":"4.3.4"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,8]]},"abstract":"<jats:p>We demonstrate a powerful and easy-to-use tool called Dedoop (&lt;u&gt;De&lt;\/u&gt;duplication with Ha&lt;u&gt;doop&lt;\/u&gt;) for MapReduce-based entity resolution (ER) of large datasets. Dedoop supports a browser-based specification of complex ER workflows including blocking and matching steps as well as the optional use of machine learning for the automatic generation of match classifiers. Specified workflows are automatically translated into MapReduce jobs for parallel execution on different Hadoop clusters. To achieve high performance Dedoop supports several advanced load balancing strategies.<\/jats:p>","DOI":"10.14778\/2367502.2367527","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"1878-1881","source":"Crossref","is-referenced-by-count":96,"title":["Dedoop"],"prefix":"10.14778","volume":"5","author":[{"given":"Lars","family":"Kolb","sequence":"first","affiliation":[{"name":"University of Leipzig"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Thor","sequence":"additional","affiliation":[{"name":"University of Leipzig"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Erhard","family":"Rahm","sequence":"additional","affiliation":[{"name":"University of Leipzig"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,8]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Dedoop. http:\/\/dbs.uni-leipzig.de\/dedoop.  Dedoop. http:\/\/dbs.uni-leipzig.de\/dedoop."},{"key":"e_1_2_1_2_1","first-page":"25","volume-title":"Churches. A Comparison of Fast Blocking Methods for Record Linkage. In Workshop Data Cleaning, Record Linkage, and Object Consolidation","author":"Baxter Christen","year":"2003","unstructured":"Baxter , Christen , and Churches. A Comparison of Fast Blocking Methods for Record Linkage. In Workshop Data Cleaning, Record Linkage, and Object Consolidation , pages 25 -- 27 , 2003 . Baxter, Christen, and Churches. A Comparison of Fast Blocking Methods for Record Linkage. In Workshop Data Cleaning, Record Linkage, and Object Consolidation, pages 25--27, 2003."},{"key":"e_1_2_1_3_1","first-page":"618","volume-title":"ICDE","author":"Kolb Thor","year":"2012","unstructured":"Kolb , Thor , and Rahm . Load Balancing for MapReduce-based Entity Resolution . In ICDE , pages 618 -- 629 , 2012 . 10.1109\/ICDE.2012.22 Kolb, Thor, and Rahm. Load Balancing for MapReduce-based Entity Resolution. In ICDE, pages 618--629, 2012. 10.1109\/ICDE.2012.22"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00450-011-0177-x"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2009.10.003"},{"issue":"1","key":"e_1_2_1_6_1","first-page":"484","article-title":"Evaluation of Entity Resolution Approaches on real-world Match Problems","volume":"3","author":"K\u00f6pcke Thor","year":"2010","unstructured":"K\u00f6pcke , Thor , and Rahm . Evaluation of Entity Resolution Approaches on real-world Match Problems . PVLDB , 3 ( 1 ): 484 -- 493 , 2010 . K\u00f6pcke, Thor, and Rahm. Evaluation of Entity Resolution Approaches on real-world Match Problems. PVLDB, 3(1):484--493, 2010.","journal-title":"PVLDB"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2367502.2367527","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:55:49Z","timestamp":1672224949000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2367502.2367527"}},"subtitle":["efficient deduplication with Hadoop"],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":6,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["10.14778\/2367502.2367527"],"URL":"https:\/\/doi.org\/10.14778\/2367502.2367527","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,8]]}}}