{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T04:53:02Z","timestamp":1775883182573,"version":"3.50.1"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Ministry of Education AcRF Tier 2","award":["MOE-T2EP20224-0020"],"award-info":[{"award-number":["MOE-T2EP20224-0020"]}]},{"name":"Tier 1 in Singapore","award":["T1 251RES2315"],"award-info":[{"award-number":["T1 251RES2315"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1109\/tkde.2026.3667997","type":"journal-article","created":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T20:59:21Z","timestamp":1771966761000},"page":"2865-2879","source":"Crossref","is-referenced-by-count":0,"title":["Geometric Partition for Billion-Scale Approximate Nearest Neighbor Search"],"prefix":"10.1109","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-9256-295X","authenticated-orcid":false,"given":"Yujian","family":"Fu","sequence":"first","affiliation":[{"name":"School of Computing, National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Chen","sequence":"additional","affiliation":[{"name":"ByteDance, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4281-2053","authenticated-orcid":false,"given":"Yao","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computing, National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5798-2282","authenticated-orcid":false,"given":"Weng-Fai","family":"Wong","sequence":"additional","affiliation":[{"name":"School of Computing, National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8618-4581","authenticated-orcid":false,"given":"Bingsheng","family":"He","sequence":"additional","affiliation":[{"name":"School of Computing, National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/3611479.3611537"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856324"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/3204028.3204034"},{"key":"ref8","first-page":"271","article-title":"Approximate nearest neighbor queries in fixed dimensions","volume-title":"Proc. Annu. ACM-SIAM Symp. Discrete Algorithm","author":"Arya"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14778\/3583140.3583166"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2361319"},{"key":"ref11","first-page":"2055","article-title":"Efficient indexing of billion-scale datasets of deep descriptors","volume-title":"Proc. IEEE Conf. Comput. Vis. Pattern Recognit.","author":"Babenko"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01258-8_13"},{"key":"ref13","article-title":"SPTAG: A library for fast approximate nearest neighbor search","author":"Chen","year":"2018"},{"key":"ref14","first-page":"5199","article-title":"SPANN: Highly-efficient billion-scale approximate nearest neighborhood search","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chen"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557098"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2907086"},{"key":"ref17","article-title":"Scaling graph-based ANNs algorithms to billion-size datasets: A comparative analysis","author":"Dobson","year":"2023"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/tbdata.2025.3618474"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3408815"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3654970"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.379"},{"key":"ref24","first-page":"518","article-title":"Similarity search in high dimensions via hashing","volume-title":"Proc. VLDB Endowment","volume":"99","author":"Gionis"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14778\/3725688.3725696"},{"key":"ref26","first-page":"3887","article-title":"Accelerating large-scale inference with anisotropic vector quantization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Guo"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539414"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850470"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref30","first-page":"13771","article-title":"DiskANN: Fast accurate billion-point nearest neighbor search on a single node","volume-title":"Advances in Neural Information Processing Systems","author":"Jayaram Subramanya","year":"2019"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.298"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380600"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599406"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44415-3_4"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.106970"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3654923"},{"key":"ref41","first-page":"10672","article-title":"HM-ANN: Efficient billion-point nearest neighbor search on heterogeneous memory","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ren"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223794"},{"key":"ref43","first-page":"1135","article-title":"Scalable billion-point approximate nearest neighbor search using SmartSSDs","volume-title":"Proc. 2024 USENIX Annu. Tech. Conf.","author":"Tian"},{"key":"ref44","first-page":"171","article-title":"Towards high-throughput and low-latency billion-scale vector search via CPU\/GPU collaborative filtering and re-ranking","volume-title":"Proc. 23rd USENIX Conf. File Storage Technol.","author":"Tian"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.14778\/3424573.3424580"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415541"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3698814"},{"key":"ref48","first-page":"103076","article-title":"CSPG: Crossing sparse proximity graphs for approximate nearest neighbor search","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yang"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00517"},{"key":"ref50","article-title":"Zoom: SSD-based vector search for optimizing accuracy, latency and memory","author":"Zhang","year":"2018"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00303"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.14778\/3594512.3594527"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/11479420\/11410097.pdf?arnumber=11410097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T04:20:32Z","timestamp":1775881232000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11410097\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":48,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2026.3667997","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]}}}