{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T23:41:13Z","timestamp":1777938073818,"version":"3.51.4"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Research Grants Council of the Hong Kong SAR, China","award":["14221716"],"award-info":[{"award-number":["14221716"]}]},{"name":"Research Grants Council of the Hong Kong SAR, China","award":["12258116"],"award-info":[{"award-number":["12258116"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2018,1,1]]},"DOI":"10.1109\/tkde.2017.2756932","type":"journal-article","created":{"date-parts":[[2017,9,26]],"date-time":"2017-09-26T18:21:20Z","timestamp":1506450080000},"page":"170-184","source":"Crossref","is-referenced-by-count":14,"title":["String Similarity Search: A Hash-Based Approach"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0747-9889","authenticated-orcid":false,"given":"Hao","family":"Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9738-827X","authenticated-orcid":false,"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Can","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2627692.2627706"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.14778\/2078331.2078340"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.csl.2009.12.001"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783381"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536339"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2009-10-3-r25"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/2732296.2732299"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2000824.2000825"},{"key":"ref14","first-page":"491","article-title":"Approximate string joins in a database (almost) for free","author":"gravano","year":"2001","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref15","first-page":"189","article-title":"Detecting linkedin spammers and its spam nets","volume":"4","author":"prieto","year":"2013","journal-title":"Int J Adv Comput Sci Appl"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989370"},{"key":"ref17","article-title":"UCI Flamingo Package 4.1","author":"behm","year":"2010"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989431"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.79"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2309131"},{"key":"ref27","first-page":"327","article-title":"Min-wise independent permutations","author":"broder","year":"1998","journal-title":"Proc Annu ACM Symp Theory Comput"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593675"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376655"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568017"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213847"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807266"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749445"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872796"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526760"},{"key":"ref1","first-page":"918","article-title":"Efficient exact set-similarity joins","author":"arasu","year":"2006","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref20","first-page":"303","article-title":"VGRAM: Improving performance of approximate queries on string collections using variable-length grams","author":"li","year":"2007","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453957"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.9"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.14778\/1920841.1920992","article-title":"Trie-Join: Efficient trie-based string similarity joins with edit-distance constraints","volume":"3","author":"wang","year":"2010","journal-title":"Proc VLDB Endowment"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915211"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0252-8"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8168803\/08051071.pdf?arnumber=8051071","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:25:41Z","timestamp":1642004741000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8051071\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,1]]},"references-count":34,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2017.2756932","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2018,1,1]]}}}