{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T14:14:17Z","timestamp":1770905657924,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"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":["62090024"],"award-info":[{"award-number":["62090024"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62174162"],"award-info":[{"award-number":["62174162"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1109\/tcad.2024.3355038","type":"journal-article","created":{"date-parts":[[2024,1,18]],"date-time":"2024-01-18T13:31:50Z","timestamp":1705584710000},"page":"1781-1793","source":"Crossref","is-referenced-by-count":4,"title":["An Energy-Efficient In-Memory Accelerator for Graph Construction and Updating"],"prefix":"10.1109","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-3557-056X","authenticated-orcid":false,"given":"Mingkai","family":"Chen","sequence":"first","affiliation":[{"name":"State Key Laboratory of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5542-7306","authenticated-orcid":false,"given":"Cheng","family":"Liu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8407-2594","authenticated-orcid":false,"given":"Shengwen","family":"Liang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3127-3266","authenticated-orcid":false,"given":"Lei","family":"He","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5172-4736","authenticated-orcid":false,"given":"Ying","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]},{"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8082-4218","authenticated-orcid":false,"given":"Huawei","family":"Li","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0874-814X","authenticated-orcid":false,"given":"Xiaowei","family":"Li","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Processors, Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}]}],"member":"263","reference":[{"key":"ref1","first-page":"679","article-title":"Large graph construction for scalable semi-supervised learning","volume-title":"Proc. 27th Int. Conf. Int. Conf. Mach. Learn.","author":"Liu"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054425"},{"key":"ref3","first-page":"7803","article-title":"Graph-based nearest Neighbor search: From practice to theory","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Prokhorenkova"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964956"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3469379.3469384"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2021.3073811"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476255"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/tbdata.2021.3101517"},{"key":"ref9","first-page":"271","article-title":"Approximate nearest Neighbor queries in fixed dimensions","volume-title":"Proc. 4th Annu. ACM SIAM Symp. Discrete Algorithms","author":"Arya"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3341105.3374013"},{"key":"ref12","article-title":"DiskANN: Fast accurate billion-point nearest Neighbor search on a single node","volume-title":"Advances in Neural Information Processing Systems","volume":"32","author":"Jayaram Subramanya","year":"2019"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-43659-3_24"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"ref15","article-title":"EFANNA: An extremely fast approximate nearest neighbor search algorithm based on kNN graph","author":"Fu","year":"2016","journal-title":"arXiv:1609.07228"},{"key":"ref16","article-title":"HM-ANN: Efficient billion-point nearest Neighbor search on heterogeneous memory","volume-title":"Advances in Neural Information Processing Systems","volume":"33","author":"Ren","year":"2020"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3458744.3474053"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2022.3161156"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358259"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00024"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2022.3155956"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"ref24","first-page":"21","article-title":"A hardware processing unit for point sets","volume-title":"Proc. 23rd ACM Siggr.\/Eurograph. Symp. Graph. Hardw.","author":"Heinzle"},{"key":"ref25","article-title":"Application-driven near-data processing for similarity search","author":"Lee","year":"2016","journal-title":"arXiv:1606.03742"},{"key":"ref26","volume-title":"Datasets for approximate nearest neighbor search","author":"Laurent","year":"2010"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465296"},{"key":"ref28","volume-title":"Twitter statistics","author":"Jonathan","year":"2013"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/12.895938"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2017.48"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2015.2414456"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2018.2876312"},{"key":"ref33","volume-title":"Intel 64 and IA-32 Architectures Software Developer Manual, Volume 3B: System Programming Guide","year":"2011"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3543622.3573189"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-020-00819-6"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.14778\/3489496.3489506"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482344"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00046"},{"key":"ref39","article-title":"TPU-KNN: K nearest Neighbor search at peak FLOP\/s","author":"Chern","year":"2022","journal-title":"arXiv:2206.14286"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586221"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2018.8342150"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISLPED.2019.8824822"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.23919\/DATE48585.2020.9116542"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISLPED.2019.8824799"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.23919\/DATE54114.2022.9774535"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/10535356\/10404048.pdf?arnumber=10404048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T20:40:19Z","timestamp":1768941619000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10404048\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":45,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2024.3355038","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6]]}}}