{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T04:29:26Z","timestamp":1768105766058,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,13]],"date-time":"2011-06-13T00:00:00Z","timestamp":1307923200000},"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":[[2011,6,13]]},"DOI":"10.1145\/1998076.1998093","type":"proceedings-article","created":{"date-parts":[[2011,6,28]],"date-time":"2011-06-28T17:34:50Z","timestamp":1309282490000},"page":"85-94","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Eliminating the redundancy in blocking-based entity resolution methods"],"prefix":"10.1145","author":[{"given":"George","family":"Papadakis","sequence":"first","affiliation":[{"name":"National Technical University of Athens, Greece & L3S Research Center, Germany, Athens, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ekaterini","family":"Ioannou","sequence":"additional","affiliation":[{"name":"Technical University of Crete, Greece, Chania, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudia","family":"Nieder\u00e9e","sequence":"additional","affiliation":[{"name":"L3S Research Center, Germany, Hannover, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Themis","family":"Palpanas","sequence":"additional","affiliation":[{"name":"University of Trento, Italy, Trento, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Nejdl","sequence":"additional","affiliation":[{"name":"L3S Research Center, Germany, Hannover, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.13"},{"key":"e_1_3_2_1_2_1","volume-title":"IIWeb","author":"Cohen W. W.","year":"2003","unstructured":"W. W. Cohen , P. D. Ravikumar , and S. E. Fienberg . A comparison of string distance metrics for name-matching tasks . In IIWeb , 2003 . W. W. Cohen, P. D. Ravikumar, and S. E. Fienberg. A comparison of string distance metrics for name-matching tasks. In IIWeb, 2003."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1645994"},{"key":"e_1_3_2_1_4_1","author":"Doan A.","year":"2005","unstructured":"A. Doan and A. Y. Halevy . Semantic integration research in the database community: A brief survey. AI Magazine , 2005 . A. Doan and A. Y. Halevy. Semantic integration research in the database community: A brief survey. AI Magazine, 2005.","journal-title":"AI Magazine"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066168"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.9"},{"key":"e_1_3_2_1_7_1","volume-title":"VLDB","author":"Gionis A.","year":"1999","unstructured":"A. Gionis , P. Indyk , and R. Motwani . Similarity search in high dimensions via hashing . In VLDB , 1999 . A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB, 1999."},{"key":"e_1_3_2_1_8_1","volume-title":"VLDB","author":"Gravano L.","year":"2001","unstructured":"L. Gravano , P. G. Ipeirotis , H. V. Jagadish , N. Koudas , S. Muthukrishnan , and D. Srivastava . Approximate string joins in a database (almost) for free . In VLDB , 2001 . L. Gravano, P. G. Ipeirotis, H. V. Jagadish, N. Koudas, S. Muthukrishnan, and D. Srivastava. Approximate string joins in a database (almost) for free. In VLDB, 2001."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/996350.996419"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065385.1065462"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223807"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1138394.1138401"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142599"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1077501.1077514"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-006-0226-8"},{"key":"e_1_3_2_1_16_1","volume-title":"CIDR","author":"Madhavan J.","year":"2007","unstructured":"J. Madhavan , S. Cohen , X. L. Dong , A. Y. Halevy , S. R. Jeffery , D. Ko , and C. Yu . Web-scale data integration: You can afford to pay as you go . In CIDR , 2007 . J. Madhavan, S. Cohen, X. L. Dong, A. Y. Halevy, S. R. Jeffery, D. Ko, and C. Yu. Web-scale data integration: You can afford to pay as you go. In CIDR, 2007."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347123"},{"key":"e_1_3_2_1_18_1","volume-title":"AAAI","author":"Michelson M.","year":"2006","unstructured":"M. Michelson and C. A. Knoblock . Learning blocking schemes for record linkage . In AAAI , 2006 . M. Michelson and C. A. Knoblock. Learning blocking schemes for record linkage. In AAAI, 2006."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367895"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065385.1065463"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935903"},{"key":"e_1_3_2_1_23_1","volume-title":"DASFAA (to appear)","author":"Papapetrou O.","year":"2011","unstructured":"O. Papapetrou and L. Chen . Xstreamcluster: an efficient algorithm for streaming xml data clustering . In DASFAA (to appear) , 2011 . O. Papapetrou and L. Chen. Xstreamcluster: an efficient algorithm for streaming xml data clustering. In DASFAA (to appear), 2011."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739104"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1255175.1255243"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775099"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555400.1555408"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559870"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1255175.1255213"}],"event":{"name":"JCDL '11: Joint Conference on Digital Libraries","location":"Ottawa Ontario Canada","acronym":"JCDL '11","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval","IEEE CS"]},"container-title":["Proceedings of the 11th annual international ACM\/IEEE joint conference on Digital libraries"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1998076.1998093","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1998076.1998093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:18Z","timestamp":1750244778000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1998076.1998093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,13]]},"references-count":28,"alternative-id":["10.1145\/1998076.1998093","10.1145\/1998076"],"URL":"https:\/\/doi.org\/10.1145\/1998076.1998093","relation":{},"subject":[],"published":{"date-parts":[[2011,6,13]]},"assertion":[{"value":"2011-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}