{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T16:54:26Z","timestamp":1773939266227,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Hong Kong Jockey Club Charities Trust"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1109\/tkde.2023.3295831","type":"journal-article","created":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T17:53:07Z","timestamp":1689616387000},"page":"1000-1015","source":"Crossref","is-referenced-by-count":26,"title":["DB-LSH 2.0: Locality-Sensitive Hashing With Query-Based Dynamic Bucketing"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6876-5059","authenticated-orcid":false,"given":"Yao","family":"Tian","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Kowloon, Hong Kong"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3240-8225","authenticated-orcid":false,"given":"Xi","family":"Zhao","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Kowloon, Hong Kong"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6343-1455","authenticated-orcid":false,"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Hong Kong University of Science and Technology, Kowloon, Hong Kong"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s11192-017-2569-6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3347047"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559905"},{"key":"ref6","article-title":"LSH algorithm and implementation (E2LSH)","author":"Andoni","year":"2016"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850470"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397240"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00095"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/2735461.2735462"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377374"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213898"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588565"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882930"},{"key":"ref15","first-page":"518","article-title":"Similarity search in high dimensions via hashing","volume-title":"Proc. 25th Int. Conf. Very Large Data Bases","author":"Gionis"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060840"},{"key":"ref18","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","volume-title":"Proc. 25th Int. Conf. Very Large Data Bases","author":"Lv"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732947"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"ref21","first-page":"1225","article-title":"Practical and optimal LSH for angular distance","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Andoni"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746553"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389778"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109688"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140440"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00169"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00635-4"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"ref29","first-page":"1926","article-title":"On symmetric and asymmetric LSHs for inner product search","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Neyshabur"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219971"},{"key":"ref31","first-page":"2956","article-title":"Norm-ranging LSH for maximum inner product search","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Yan"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457240"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288933"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45072-6_2"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375679"},{"key":"ref38","first-page":"263","article-title":"Integrating the UB-tree into a database system kernel","volume-title":"Proc. 25th Int. Conf. Very Large Data Bases","author":"Ramsak"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3206441"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389703"},{"key":"ref41","first-page":"28","article-title":"The X-tree: An index structure for high-dimensional data","volume-title":"Proc. 25th Int. Conf. Very Large Data Bases","author":"Berchtold"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/320248.320255"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00214"},{"key":"ref44","first-page":"41","article-title":"On the difficulty of nearest neighbor search","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"He"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2909204"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10422839\/10184454.pdf?arnumber=10184454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T19:52:08Z","timestamp":1707767528000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10184454\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":45,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2023.3295831","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3]]}}}