{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:34:56Z","timestamp":1758267296626,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1805263","61672157","61772004"],"award-info":[{"award-number":["U1805263","61672157","61772004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project of Fujian Province Science and Technology Plan","award":["2016H6007"],"award-info":[{"award-number":["2016H6007"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Internet Things J."],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1109\/jiot.2019.2914344","type":"journal-article","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T21:01:08Z","timestamp":1556744468000},"page":"7122-7136","source":"Crossref","is-referenced-by-count":9,"title":["FJLT-FLSH: More Efficient Fly Locality-Sensitive Hashing Algorithm via FJLT for WMSN IoT Search"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6990-5893","authenticated-orcid":false,"given":"Wenhao","family":"Shao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2173-4612","authenticated-orcid":false,"given":"Ruliang","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huakun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3485-2175","authenticated-orcid":false,"given":"Xin","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502809"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuron.2010.04.009"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1017\/S0952523800009640"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10073"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1201\/9781420035315.ch8"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/859859"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132597"},{"key":"ref11","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","author":"lv","year":"2007","journal-title":"Proc 33rd Int'l Conf Very Large Data Bases (VLDB)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"ref13","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2009","journal-title":"Proc Neural Inf Process Syst (NIPS)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140440"},{"key":"ref15","article-title":"Lower bounds on time-space trade-offs for approximate near neighbors","author":"andoni","year":"2016","journal-title":"arXiv preprint arXiv 1605 09090"},{"key":"ref16","first-page":"67","article-title":"LSH forest: practical algorithms made theoretical","author":"andoni","year":"2017","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref17","article-title":"Multi-level spherical locality sensitive hashing for approximate near neighbors","author":"brooks","year":"2017","journal-title":"arXiv preprint arXiv 1709 04396"},{"key":"ref18","article-title":"Lattice-based locality sensitive hashing is optimal","author":"chandrasekaran","year":"2017","journal-title":"arXiv preprint arXiv 1712 08558"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1186\/s13638-018-1221-3"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/j.future.2017.04.039","article-title":"An efficient algorithm for media-based surveillance system (EAMSuS) in IoT smart city framework","volume":"83","author":"vaesileios","year":"2018","journal-title":"Future Gener Comput Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553516"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/ett.3443"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3131542.3131563"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(88)90043-3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/026\/737400"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1126\/science.aam9868"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2812239"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/nem.1930"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a014"},{"key":"ref22","article-title":"Fast locality-sensitive hashing frameworks for approximate near neighbor search","author":"christiani","year":"2017","journal-title":"arXiv preprint arXiv 1708 05227"},{"key":"ref21","first-page":"1225","article-title":"Practical and optimal LSH for angular distance","author":"andoni","year":"2015","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref24","first-page":"27","article-title":"Algorithms for efficient digital media transmission over IoT and cloud networking","volume":"5","author":"stergiou","year":"2018","journal-title":"J Multimedia Inf Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2016.11.031"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-018-6288-7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2018.02.012"}],"container-title":["IEEE Internet of Things Journal"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488907\/8784345\/08703737.pdf?arnumber=8703737","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:56:11Z","timestamp":1657745771000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8703737\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":35,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/jiot.2019.2914344","relation":{},"ISSN":["2327-4662","2372-2541"],"issn-type":[{"type":"electronic","value":"2327-4662"},{"type":"electronic","value":"2372-2541"}],"subject":[],"published":{"date-parts":[[2019,8]]}}}