{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T16:38:08Z","timestamp":1781714288086,"version":"3.54.5"},"reference-count":10,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000028","name":"Semiconductor Research Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000028","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Global Scholars Invitation Program","award":["RS-2024-00456287"],"award-info":[{"award-number":["RS-2024-00456287"]}]},{"name":"Institute of Information & Communications Technology Planning"},{"name":"Korea Government","award":["2018-0-00503"],"award-info":[{"award-number":["2018-0-00503"]}]},{"name":"Korea Government","award":["RS-2024-00396013"],"award-info":[{"award-number":["RS-2024-00396013"]}]},{"name":"Korea Government","award":["RS-2024-00459797"],"award-info":[{"award-number":["RS-2024-00459797"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Comput. Arch. Lett."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1109\/lca.2025.3596970","type":"journal-article","created":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T18:38:52Z","timestamp":1754678332000},"page":"289-292","source":"Crossref","is-referenced-by-count":1,"title":["CABANA : Cluster-Aware Query Batching for Accelerating Billion-Scale ANNS With Intel AMX"],"prefix":"10.1109","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-3604-3901","authenticated-orcid":false,"given":"Minho","family":"Kim","sequence":"first","affiliation":[{"name":"Daegu Gyeongbuk Institute of Science & Technology, Daegu, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-8402-0127","authenticated-orcid":false,"given":"Houxiang","family":"Ji","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-0023-743X","authenticated-orcid":false,"given":"Jaeyoung","family":"Kang","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-0513-2112","authenticated-orcid":false,"given":"Hwanjun","family":"Lee","sequence":"additional","affiliation":[{"name":"Daegu Gyeongbuk Institute of Science & Technology, Daegu, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0837-0877","authenticated-orcid":false,"given":"Daehoon","family":"Kim","sequence":"additional","affiliation":[{"name":"Yonsei University, Seoul, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0442-5634","authenticated-orcid":false,"given":"Nam Sung","family":"Kim","sequence":"additional","affiliation":[{"name":"University of Illinois Urbana-Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3669940.3707264"},{"key":"ref2","first-page":"1135","article-title":"Scalable billion-point approximate nearest neighbor search using SmartSSDs","volume-title":"Proc. 2024 USENIX Annu. Tech. Conf.","author":"Tian","year":"2024"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2909204"},{"key":"ref4","first-page":"23","article-title":"Fast vector query processing for large datasets beyond GPU memory with reordered pipelining","volume-title":"Proc. 21st USENIX Symp. Networked Syst. Des. Implementation","author":"Zhang","year":"2024"},{"key":"ref5","article-title":"Billion-scale approximate nearest neighbor search challenge: NeurIPS\u201921 competition track","year":"2021"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3390\/math12233787"},{"key":"ref7","article-title":"Intel advanced vector extensions 512 (AVX-512)","year":"2025"},{"key":"ref8","first-page":"552","article-title":"SIMD2: A generalized matrix instruction set for accelerating tensor computation beyond GEMM","volume-title":"Proc. 49th Annu. Int. Symp. Comput. Architecture","author":"Zhang","year":"2022"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3695053.3731092"},{"key":"ref10","article-title":"The Faiss library","author":"Douze","year":"2024"}],"container-title":["IEEE Computer Architecture Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10208\/11062520\/11120372.pdf?arnumber=11120372","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T17:30:35Z","timestamp":1757611835000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11120372\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":10,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lca.2025.3596970","relation":{},"ISSN":["1556-6056","1556-6064","2473-2575"],"issn-type":[{"value":"1556-6056","type":"print"},{"value":"1556-6064","type":"electronic"},{"value":"2473-2575","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7]]}}}