{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T22:53:43Z","timestamp":1769036023957,"version":"3.49.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T00:00:00Z","timestamp":1761091200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T00:00:00Z","timestamp":1761091200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2334268"],"award-info":[{"award-number":["2334268"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,10,22]]},"DOI":"10.1109\/cbmi66578.2025.11339281","type":"proceedings-article","created":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T20:38:56Z","timestamp":1768941536000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["Accelerating Vector Search at Scale: BAM-ANN with Batch-Aware Memory-Disk Hybrid Indexing"],"prefix":"10.1109","author":[{"given":"M M Mahabubur","family":"Rahman","sequence":"first","affiliation":[{"name":"Texas State University,Computer Science,San Marcos,TX,USA"}]},{"given":"Jelena","family":"Te\u0161i\u0107","sequence":"additional","affiliation":[{"name":"Texas State University,Computer Science,San Marcos,TX,USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3097987"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539212"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403305"},{"key":"ref4","article-title":"Openagi: When 11m meets domain experts","volume":"36","author":"Ge","year":"2024","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s13735-024-00342-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377374"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108356"},{"key":"ref8","first-page":"5199","article-title":"Spann: Highly-efficient billion-scale approximate nearest neighborhood search","volume":"34","author":"Chen","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"ref10","article-title":"Diskann: Fast accurate billion-point nearest neighbor search on a single node","volume":"32","author":"Subramanya","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref11","first-page":"10672","article-title":"Hm-ann: Efficient billion-point nearest neighbor search on heterogeneous memory","volume":"33","author":"Ren","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3581783.3612290"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/BigData55660.2022.10020464"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01258-8_13"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2361319"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.298"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.226"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357938"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref23","volume-title":"Revisiting the inverted indices for billion-scale approximate nearest neighbors","volume":"abs\/1802.02422","author":"Baranchuk","year":"2018"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00762-0"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.5555\/3294996.3295070"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"ref27","volume-title":"Spacev1b","year":"2021"}],"event":{"name":"2025 International Conference on Content-Based Multimedia Indexing (CBMI)","location":"Dublin, Ireland","start":{"date-parts":[[2025,10,22]]},"end":{"date-parts":[[2025,10,24]]}},"container-title":["2025 International Conference on Content-Based Multimedia Indexing (CBMI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11339229\/11339242\/11339281.pdf?arnumber=11339281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T07:37:23Z","timestamp":1768981043000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11339281\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,22]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/cbmi66578.2025.11339281","relation":{},"subject":[],"published":{"date-parts":[[2025,10,22]]}}}