{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T02:52:36Z","timestamp":1776394356523,"version":"3.51.2"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100007567","name":"CityU","doi-asserted-by":"publisher","award":["7200387"],"award-info":[{"award-number":["7200387"]}],"id":[{"id":"10.13039\/100007567","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003452","name":"ITF","doi-asserted-by":"publisher","award":["ITS\/307\/15"],"award-info":[{"award-number":["ITS\/307\/15"]}],"id":[{"id":"10.13039\/501100003452","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2017,4,1]]},"DOI":"10.1109\/tkde.2016.2638838","type":"journal-article","created":{"date-parts":[[2016,12,13]],"date-time":"2016-12-13T14:26:29Z","timestamp":1481639189000},"page":"712-726","source":"Crossref","is-referenced-by-count":20,"title":["A Generic Method for Accelerating LSH-Based Similarity Join Processing"],"prefix":"10.1109","volume":"29","author":[{"given":"Chenyun","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarana","family":"Nutanong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hangyu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingliang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139924801"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1089\/10665270360688093"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref10","first-page":"541","article-title":"Locality-sensitive hashing scheme based on dynamic\n collision counting","author":"gan","year":"2012","journal-title":"Proc ACM SIGMOD Int Conf Manage Data"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkr1079"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90022-2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850470"},{"key":"ref15","first-page":"491","article-title":"Approximate string joins in a database (almost) for free","author":"gravano","year":"2001","journal-title":"Proc 27th Int Conf Very Large Data Bases"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45022-X_67"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375714"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502524"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1366102.1366104"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/2428536.2428538"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0408-z"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45227-0_48"},{"key":"ref6","first-page":"518","article-title":"Similarity\n search in high dimensions via hashing","author":"gionis","year":"1999","journal-title":"Proc 5th Int Conf Very Large Data Bases"},{"key":"ref29","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref8","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","author":"lv","year":"2007","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109688"},{"key":"ref2","first-page":"426","article-title":"M-tree: An\n efficient access method for similarity search in metric spaces","author":"ciaccia","year":"1997","journal-title":"Proc 23rd Int Conf Very Large Data Bases"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1806907.1806912"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/170036.170075"},{"key":"ref20","article-title":"Introduction to mathematical statistics","author":"hoel","year":"1954","journal-title":"Introduction to Mathematical Statistics"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/2735461.2735462"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2745754.2745761"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350233"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2419663"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.05.025"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7872536\/07782356.pdf?arnumber=7782356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:42:52Z","timestamp":1641987772000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7782356\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,1]]},"references-count":32,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2016.2638838","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2017,4,1]]}}}