{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:23:30Z","timestamp":1757543010633,"version":"3.41.2"},"reference-count":14,"publisher":"IEEE","license":[{"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1109\/iccse.2019.8845438","type":"proceedings-article","created":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T21:29:51Z","timestamp":1569274191000},"page":"5-10","source":"Crossref","is-referenced-by-count":3,"title":["Locality-Sensitive Hashing Scheme Based on Heap Sort of Hash Bucket"],"prefix":"10.1109","author":[{"given":"Bo","family":"Fang","sequence":"first","affiliation":[{"name":"School of computer science and technology, Harbin Institute of Technology shenzhen, Shenzhen, China"}]},{"given":"Zhongyun","family":"Hua","sequence":"additional","affiliation":[{"name":"School of computer science and technology, Harbin Institute of Technology shenzhen, Shenzhen, China"}]},{"given":"Hejiao","family":"Huang","sequence":"additional","affiliation":[{"name":"School of computer science and technology, Harbin Institute of Technology shenzhen, Shenzhen, China"}]}],"member":"263","reference":[{"key":"ref10","first-page":"950c96l","article-title":"Multi-probe LSH. efficient indexing for high-dimensional similarity search","author":"lv","year":"2007","journal-title":"VLDB"},{"journal-title":"Improved locality-sensitive hashing method for the approximate nearest neighbor problem","year":"2014","author":"ying-hua","key":"ref11"},{"key":"ref12","volume":"209","author":"joly","year":"2008","journal-title":"Proc 16th ACM International Conference on Multimedia 2008"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213898"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882930"},{"journal-title":"Foundations of Multidimensional and Metric Data Structures","year":"2006","author":"samet","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253347"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1806907.1806912"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556574"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref2","article-title":"Title of paper if known","author":"bentley","year":"1990","journal-title":"K-D trees for semi-dynamic points sets In Symposium on Computational Geometry"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/971697.602266"},{"journal-title":"Panigrahy R 2006 Proceedings of the 17 th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA)","first-page":"1186","year":"2006","key":"ref9"}],"event":{"name":"2019 14th International Conference on Computer Science & Education (ICCSE)","start":{"date-parts":[[2019,8,19]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2019,8,21]]}},"container-title":["2019 14th International Conference on Computer Science & Education (ICCSE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8839660\/8845050\/08845438.pdf?arnumber=8845438","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T18:21:27Z","timestamp":1753813287000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8845438\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/iccse.2019.8845438","relation":{},"subject":[],"published":{"date-parts":[[2019,8]]}}}