{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:52Z","timestamp":1750307332449,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,12]],"date-time":"2011-06-12T00:00:00Z","timestamp":1307836800000},"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,12]]},"DOI":"10.1145\/1999299.1999302","type":"proceedings-article","created":{"date-parts":[[2011,6,21]],"date-time":"2011-06-21T13:47:14Z","timestamp":1308664034000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["To compare or not to compare"],"prefix":"10.1145","author":[{"given":"George","family":"Papadakis","sequence":"first","affiliation":[{"name":"National Technical University of Athens, Greece and L3S Research Center, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ekaterini","family":"Ioannou","sequence":"additional","affiliation":[{"name":"Technical University of Crete, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudia","family":"Nieder\u00e9e","sequence":"additional","affiliation":[{"name":"L3S Research Center, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Themis","family":"Palpanas","sequence":"additional","affiliation":[{"name":"University of Trento, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Nejdl","sequence":"additional","affiliation":[{"name":"L3S Research Center, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,6,12]]},"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","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.9"},{"key":"e_1_3_2_1_3_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_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223807"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739104"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-006-0226-8"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347123"},{"key":"e_1_3_2_1_8_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_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935903"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1998076.1998093"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1645994"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559870"}],"event":{"name":"SIGMOD\/PODS '11: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Athens Greece","acronym":"SIGMOD\/PODS '11"},"container-title":["Proceedings of the International Workshop on Semantic Web Information Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1999299.1999302","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1999299.1999302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:10Z","timestamp":1750244770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1999299.1999302"}},"subtitle":["making entity resolution more efficient"],"short-title":[],"issued":{"date-parts":[[2011,6,12]]},"references-count":12,"alternative-id":["10.1145\/1999299.1999302","10.1145\/1999299"],"URL":"https:\/\/doi.org\/10.1145\/1999299.1999302","relation":{},"subject":[],"published":{"date-parts":[[2011,6,12]]},"assertion":[{"value":"2011-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}