{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:03Z","timestamp":1750306083308,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T00:00:00Z","timestamp":1503446400000},"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":[[2017,8,23]]},"DOI":"10.1145\/3106426.3106484","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T12:12:36Z","timestamp":1502367156000},"page":"97-105","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Preference-driven similarity join"],"prefix":"10.1145","author":[{"given":"Chuancong","family":"Gao","sequence":"first","affiliation":[{"name":"Simon Fraser University"}]},{"given":"Jiannan","family":"Wang","sequence":"additional","affiliation":[{"name":"Simon Fraser University"}]},{"given":"Jian","family":"Pei","sequence":"additional","affiliation":[{"name":"Simon Fraser University"}]},{"given":"Rui","family":"Li","sequence":"additional","affiliation":[{"name":"Google Inc."}]},{"given":"Yi","family":"Chang","sequence":"additional","affiliation":[{"name":"Huawei Research America"}]}],"member":"320","published-online":{"date-parts":[[2017,8,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"http:\/\/www.dcs.bbk.ac.uk\/~ROGER\/corpora.html.  http:\/\/www.dcs.bbk.ac.uk\/~ROGER\/corpora.html."},{"key":"e_1_3_2_1_2_1","unstructured":"http:\/\/www.cs.utexas.edu\/users\/ml\/riddle\/data.html.  http:\/\/www.cs.utexas.edu\/users\/ml\/riddle\/data.html."},{"key":"e_1_3_2_1_3_1","unstructured":"http:\/\/dbs.uni-leipzig.de\/en\/research\/projects\/object_matching.  http:\/\/dbs.uni-leipzig.de\/en\/research\/projects\/object_matching."},{"key":"e_1_3_2_1_4_1","unstructured":"http:\/\/www.iesl.cs.umass.edu\/data\/wiki-links.  http:\/\/www.iesl.cs.umass.edu\/data\/wiki-links."},{"key":"e_1_3_2_1_5_1","volume-title":"Handbook of mathematical economics. Handbook of mathematical economics","author":"Arrow K. J.","year":"1991","unstructured":"K. J. Arrow , M. D. Intriligator , W. Hildenbrand , and H. Sonnenschein . Handbook of mathematical economics. Handbook of mathematical economics , 1991 . K. J. Arrow, M. D. Intriligator, W. Hildenbrand, and H. Sonnenschein. Handbook of mathematical economics. Handbook of mathematical economics, 1991."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735496.2735500"},{"key":"e_1_3_2_1_7_1","unstructured":"A. Arasu V. Ganti and R. Kaushik. Efficient exact set-similarity joins. In VLDB'2006.   A. Arasu V. Ganti and R. Kaushik. Efficient exact set-similarity joins. In VLDB '2006."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807252"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242591"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2428536.2428537"},{"volume-title":"CIKM'2015","author":"B\u00fcch L.","key":"e_1_3_2_1_11_1","unstructured":"L. B\u00fcch and A. Andrzejak . Approximate string matching by end-users using active learning . In CIKM'2015 . L. B\u00fcch and A. Andrzejak. Approximate string matching by end-users using active learning. In CIKM'2015."},{"key":"e_1_3_2_1_12_1","unstructured":"S. Chaudhuri B. Chen V. Ganti and R. Kaushik. Example-driven design of efficient record matching queries. In VLDB'2007.   S. Chaudhuri B. Chen V. Ganti and R. Kaushik. Example-driven design of efficient record matching queries. In VLDB' 2007."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.9"},{"volume-title":"ICDE'2014","author":"Deng D.","key":"e_1_3_2_1_14_1","unstructured":"D. Deng , G. Li , S. Hao , J. Wang , and J. Feng . Massjoin: A mapreduce-based method for scalable string similarity joins . In ICDE'2014 . D. Deng, G. Li, S. Hao, J. Wang, and J. Feng. Massjoin: A mapreduce-based method for scalable string similarity joins. In ICDE'2014."},{"key":"e_1_3_2_1_15_1","volume-title":"Dynamic graph algorithms","author":"Eppstein D.","year":"1998","unstructured":"D. Eppstein , Z. Galil , and G. F. Italiano , Dynamic graph algorithms . 1998 . D. Eppstein, Z. Galil, and G. F. Italiano, Dynamic graph algorithms. 1998."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"C. Gao J. Pei J. Wang and Y. Chang. Schemaless Join for Result Set Preferences. In IRI'2017.  C. Gao J. Pei J. Wang and Y. Chang. Schemaless Join for Result Set Preferences. In IRI' 2017.","DOI":"10.1109\/IRI.2017.26"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588576"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732296.2732299"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.87"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078340"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465313"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212353"},{"volume-title":"An Efficient Domain-Independent Algorithm for Detecting Approximately Duplicate Database Records. In DMKD'1997","author":"Monge A. E.","key":"e_1_3_2_1_23_1","unstructured":"A. E. Monge and C. Elkan . An Efficient Domain-Independent Algorithm for Detecting Approximately Duplicate Database Records. In DMKD'1997 . A. E. Monge and C. Elkan. An Efficient Domain-Independent Algorithm for Detecting Approximately Duplicate Database Records. In DMKD'1997."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000824.2000829"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1037\/0033-295X.84.4.327"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807222"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920992"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213847"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/2021017.2021020"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453957"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.111"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367516"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0892-x"}],"event":{"name":"WI '17: International Conference on Web Intelligence 2017","sponsor":["SIGAI ACM Special Interest Group on Artificial Intelligence","TCII IEEE Computer Society Technical Committee on Intelligent Informatics","Web Intelligence Consortium"],"location":"Leipzig Germany","acronym":"WI '17"},"container-title":["Proceedings of the International Conference on Web Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3106426.3106484","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3106426.3106484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:13Z","timestamp":1750217413000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3106426.3106484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,23]]},"references-count":33,"alternative-id":["10.1145\/3106426.3106484","10.1145\/3106426"],"URL":"https:\/\/doi.org\/10.1145\/3106426.3106484","relation":{},"subject":[],"published":{"date-parts":[[2017,8,23]]},"assertion":[{"value":"2017-08-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}