{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T22:59:05Z","timestamp":1792796345804,"version":"4.5.0"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100014188","name":"Ministry of Science and ICT, South Korea","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Information Technology Research Center","award":["IITP-2020-0-01847"],"award-info":[{"award-number":["IITP-2020-0-01847"]}]},{"name":"Institute for Information & Communications Technology Planning & Evaluation","id":[{"id":"https:\/\/ror.org\/01g0hqq23","id-type":"ROR","asserted-by":"crossref"}]},{"name":"Samsung","award":["IO201210-07991-01"],"award-info":[{"award-number":["IO201210-07991-01"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1109\/tc.2022.3155956","type":"journal-article","created":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T15:26:24Z","timestamp":1646321184000},"page":"278-290","source":"Crossref","is-referenced-by-count":36,"title":["Accelerating Large-Scale Graph-Based Nearest Neighbor Search on a Computational Storage Platform"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4895-0369","authenticated-orcid":false,"given":"Ji-Hoon","family":"Kim","sequence":"first","affiliation":[{"name":"Korea Advanced Institute of Science and Technology","place":["Daejeon, Korea"],"department":["Department of Electrical Engineering"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yeo-Reum","family":"Park","sequence":"additional","affiliation":[{"name":"Korea Advanced Institute of Science and Technology","place":["Daejeon, Korea"],"department":["Department of Electrical Engineering"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1275-1621","authenticated-orcid":false,"given":"Jaeyoung","family":"Do","sequence":"additional","affiliation":[{"name":"Amazon Alexa AI","place":["Seattle, WA, USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Soo-Young","family":"Ji","sequence":"additional","affiliation":[{"name":"Samsung Electronics","place":["Gyonggi-do, Korea"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joo-Young","family":"Kim","sequence":"additional","affiliation":[{"name":"Korea Advanced Institute of Science and Technology","place":["Daejeon, Korea"],"department":["Department of Electrical Engineering"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","article-title":"Nearest neighbor search in google correlate","author":"vanderkam","year":"2013","journal-title":"Tech Rep"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1037\/0033-295X.93.1.3"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587633"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1995412.1995420"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00517"},{"key":"ref36","first-page":"311","article-title":"Data structures and algorithms for nearest neighbor search in general metric spaces","volume":"93","author":"yianilos","year":"1993","journal-title":"Proc 9th Annual ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref35","article-title":"Approximate nearest neighbor negative contrastive learning for dense text retrieval","author":"xiong","year":"2020"},{"key":"ref34","article-title":"Quantum nearest-neighbor algorithms for machine learning","volume":"15","author":"wiebe","year":"2018","journal-title":"Quantum Inform Comput"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.5334\/dsj-2015-002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.12792\/iciae2015.051"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465295"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"ref14","article-title":"Pattern classification","volume":"2","author":"duda","year":"2001"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2909437.2909447"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"ref17","first-page":"518","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"1999","journal-title":"Proc 5th Int Conf Very Large Data Bases"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3007787.3001154"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"ref4","year":"0"},{"key":"ref28","article-title":"Computational storage for big data analytics","author":"samynathan","year":"2019","journal-title":"Proc 10th Int Workshop Accelerating Analytics Data Manage Syst"},{"key":"ref3","year":"0"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref6","year":"0"},{"key":"ref5","year":"0"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.14778\/2735461.2735462"},{"key":"ref8","first-page":"217","article-title":"When is “nearest neighbor","author":"beyer","year":"1999","journal-title":"Intl Conf on Database Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICFPT47387.2019.00019"},{"key":"ref2","year":"0"},{"key":"ref1","year":"0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587598"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505665"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-009-0285-2"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2020.3009347"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2013.6558444"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.006"},{"key":"ref25","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/9984045\/09726805.pdf?arnumber=9726805","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,10]],"date-time":"2026-08-10T19:03:09Z","timestamp":1786388589000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9726805\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":37,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tc.2022.3155956","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1]]}}}