{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:15:38Z","timestamp":1740132938603,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2016,5,1]],"date-time":"2016-05-01T00:00:00Z","timestamp":1462060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100001641","name":"GRF","doi-asserted-by":"publisher","award":["152201\/14E"],"award-info":[{"award-number":["152201\/14E"]}],"id":[{"id":"10.13039\/100001641","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002920","name":"RGC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2016,5,1]]},"DOI":"10.1109\/tkde.2016.2515603","type":"journal-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T19:08:53Z","timestamp":1452193733000},"page":"1175-1188","source":"Crossref","is-referenced-by-count":5,"title":["Exploit Every Bit: Effective Caching for High-Dimensional Nearest Neighbor Search"],"prefix":"10.1109","volume":"28","author":[{"given":"Bo","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Man Lung","family":"Yiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kien A.","family":"Hua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"194","article-title":"A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces","author":"weber","year":"0","journal-title":"Proc 24th Int Conf Very Large DataBases"},{"key":"ref32","article-title":"An approximation based data structure for similarity search","author":"weber","year":"1997","journal-title":"CiteSeer"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2007.22"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587633"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212358"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"745","DOI":"10.14778\/2732939.2732947","article-title":"SK-LSH: An efficient index structure for approximate nearest neighbor search","volume":"7","author":"yingfan","year":"2014","journal-title":"Proc VLDB Endowment"},{"key":"ref34","article-title":"Spectral hashing","author":"weiss","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458172"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516450"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/354756.354820"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213898"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588565"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2307\/30037539"},{"key":"ref16","first-page":"518","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"0","journal-title":"Proc Intl Conf on Very Large Databases"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50011-2"},{"key":"ref19","first-page":"275","article-title":"Optimal histograms with quality guarantees","author":"jagadish","year":"0","journal-title":"Proc 24th Int Conf Very Large DataBases"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465274"},{"key":"ref4","article-title":"Learning to prune in metric and non-metric spaces","author":"boytsov","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.19"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502809"},{"key":"ref6","first-page":"426","article-title":"M-tree: An efficient access method for similarity search in metric spaces","author":"ciaccia","year":"0","journal-title":"Proc 23rd Int Conf Very Large Databases"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559905"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539852"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1348246.1348248"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1242524.1242525"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2004.1315173"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071612"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73540-3_5"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref24","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","author":"lv","year":"0","journal-title":"Proc Intl Conf on Very Large Databases"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276319"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(00)00308-X"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7445292\/7374714.pdf?arnumber=7374714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:11:16Z","timestamp":1642003876000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7374714\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,1]]},"references-count":36,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2016.2515603","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2016,5,1]]}}}