{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:04Z","timestamp":1750307164094,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,10,24]],"date-time":"2011-10-24T00:00:00Z","timestamp":1319414400000},"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,10,24]]},"DOI":"10.1145\/2063576.2063819","type":"proceedings-article","created":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T10:40:21Z","timestamp":1321440021000},"page":"1679-1688","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Efficient similarity search"],"prefix":"10.1145","author":[{"given":"Dustin","family":"Lange","sequence":"first","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Naumann","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,10,24]]},"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.1145\/956750.956759"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502809"},{"key":"e_1_3_2_1_4_1","first-page":"327","volume-title":"Proc. of the Intl. Conf. on Very Large Databases (VLDB)","author":"Chaudhuri S.","year":"2007","unstructured":"S. Chaudhuri , B.-C. Chen , V. Ganti , and R. Kaushik . Example-driven design of efficient record matching queries . In Proc. of the Intl. Conf. on Very Large Databases (VLDB) , pages 327 -- 338 , Vienna, Austria , 2007 . S. Chaudhuri, B.-C. Chen, V. Ganti, and R. Kaushik. Example-driven design of efficient record matching queries. In Proc. of the Intl. Conf. on Very Large Databases (VLDB), pages 327--338, Vienna, Austria, 2007."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502808"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646173"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353388"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.9"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275488"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009761603038"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2002.1048333"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1533"},{"key":"e_1_3_2_1_13_1","first-page":"440","volume-title":"Proc. of the National Conf. on Artificial Intelligence (AAAI)","author":"Michelson M.","year":"2006","unstructured":"M. Michelson and C. A. Knoblock . Learning blocking schemes for record linkage . In Proc. of the National Conf. on Artificial Intelligence (AAAI) , pages 440 -- 445 , Boston, MA, USA , 2006 . M. Michelson and C. A. Knoblock. Learning blocking schemes for record linkage. In Proc. of the National Conf. on Artificial Intelligence (AAAI), pages 440--445, Boston, MA, USA, 2006."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1841211"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"e_1_3_2_1_16_1","first-page":"2000","article-title":"A hybrid indexing method for approximate string matching","volume":"1","author":"Navarro G.","year":"2001","unstructured":"G. Navarro and R. Baeza-Yates . A hybrid indexing method for approximate string matching . Journal of Discrete Algorithms , 1 : 2000 , 2001 . G. Navarro and R. Baeza-Yates. A hybrid indexing method for approximate string matching. Journal of Discrete Algorithms, 1:2000, 2001.","journal-title":"Journal of Discrete Algorithms"},{"key":"e_1_3_2_1_17_1","first-page":"3","article-title":"the design of efficient systems for linking records into individual and family histories","volume":"19","author":"Newcombe H.","year":"1967","unstructured":"H. Newcombe . Record linkage : the design of efficient systems for linking records into individual and family histories . American Journal of Human Genetics , 19 : 3 , 1967 . H. Newcombe. Record linkage: the design of efficient systems for linking records into individual and family histories. American Journal of Human Genetics, 19:3, 1967.","journal-title":"American Journal of Human Genetics"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775087"},{"key":"e_1_3_2_1_19_1","volume-title":"Statistical Research Division","author":"Winkler W. E.","year":"1999","unstructured":"W. E. Winkler . The state of record linkage and current research problems. Technical report , Statistical Research Division , U.S. Census Bureau , 1999 . W. E. Winkler. The state of record linkage and current research problems. Technical report, Statistical Research Division, U.S. Census Bureau, 1999."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1121569"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807266"}],"event":{"name":"CIKM '11: International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Glasgow Scotland, UK","acronym":"CIKM '11"},"container-title":["Proceedings of the 20th ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063576.2063819","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2063576.2063819","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:36Z","timestamp":1750240476000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063576.2063819"}},"subtitle":["arbitrary similarity measures, arbitrary composition"],"short-title":[],"issued":{"date-parts":[[2011,10,24]]},"references-count":21,"alternative-id":["10.1145\/2063576.2063819","10.1145\/2063576"],"URL":"https:\/\/doi.org\/10.1145\/2063576.2063819","relation":{},"subject":[],"published":{"date-parts":[[2011,10,24]]},"assertion":[{"value":"2011-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}