{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:23:11Z","timestamp":1750306991587,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,6,23]],"date-time":"2013-06-23T00:00:00Z","timestamp":1371945600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,6,23]]},"DOI":"10.1145\/2486767.2486768","type":"proceedings-article","created":{"date-parts":[[2013,6,25]],"date-time":"2013-06-25T19:13:21Z","timestamp":1372187601000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Don't match twice"],"prefix":"10.1145","author":[{"given":"Lars","family":"Kolb","sequence":"first","affiliation":[{"name":"University of Leipzig"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Thor","sequence":"additional","affiliation":[{"name":"University of Leipzig"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erhard","family":"Rahm","sequence":"additional","affiliation":[{"name":"University of Leipzig"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.70"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.127"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2010.178"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1557690.1557767"},{"key":"e_1_3_2_1_5_1","volume-title":"Dedoop: Efficient Deduplication with Hadoop. PVLDB, 5(12)","author":"Kolb L.","year":"2012","unstructured":"L. Kolb , A. Thor , and E. Rahm . Dedoop: Efficient Deduplication with Hadoop. PVLDB, 5(12) , 2012 . L. Kolb, A. Thor, and E. Rahm. Dedoop: Efficient Deduplication with Hadoop. PVLDB, 5(12), 2012."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.22"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00450-011-0177-x"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2009.10.003"},{"key":"e_1_3_2_1_9_1","volume-title":"QDB","author":"McNeill N.","year":"2012","unstructured":"N. McNeill , H. Kardes , and A. Borthwick . Dynamic Record Blocking: Efficient Linking of Massive Databases in MapReduce . In QDB , 2012 . N. McNeill, H. Kardes, and A. Borthwick. Dynamic Record Blocking: Efficient Linking of Massive Databases in MapReduce. In QDB, 2012."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FUZZ.2003.1209440"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2009.49"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1998076.1998093"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935903"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp236"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807222"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367516"}],"event":{"name":"SIGMOD\/PODS'13: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"New York New York","acronym":"SIGMOD\/PODS'13"},"container-title":["Proceedings of the Second Workshop on Data Analytics in the Cloud"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486767.2486768","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2486767.2486768","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:38Z","timestamp":1750236518000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2486767.2486768"}},"subtitle":["redundancy-free similarity computation with MapReduce"],"short-title":[],"issued":{"date-parts":[[2013,6,23]]},"references-count":16,"alternative-id":["10.1145\/2486767.2486768","10.1145\/2486767"],"URL":"https:\/\/doi.org\/10.1145\/2486767.2486768","relation":{},"subject":[],"published":{"date-parts":[[2013,6,23]]},"assertion":[{"value":"2013-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}