{"id":"https://openalex.org/W7125183276","doi":"https://doi.org/10.1109/cbmi66578.2025.11339281","title":"Accelerating Vector Search at Scale: BAM-ANN with Batch-Aware Memory-Disk Hybrid Indexing","display_name":"Accelerating Vector Search at Scale: BAM-ANN with Batch-Aware Memory-Disk Hybrid Indexing","publication_year":2025,"publication_date":"2025-10-22","ids":{"openalex":"https://openalex.org/W7125183276","doi":"https://doi.org/10.1109/cbmi66578.2025.11339281"},"language":null,"primary_location":{"id":"doi:10.1109/cbmi66578.2025.11339281","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cbmi66578.2025.11339281","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Conference on Content-Based Multimedia Indexing (CBMI)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123498957","display_name":"M M Mahabubur Rahman","orcid":null},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M M Mahabubur Rahman","raw_affiliation_strings":["Texas State University,Computer Science,San Marcos,TX,USA"],"affiliations":[{"raw_affiliation_string":"Texas State University,Computer Science,San Marcos,TX,USA","institution_ids":["https://openalex.org/I13511017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5123433674","display_name":"Jelena Tesic","orcid":null},"institutions":[{"id":"https://openalex.org/I13511017","display_name":"Texas State University","ror":"https://ror.org/05h9q1g27","country_code":"US","type":"education","lineage":["https://openalex.org/I13511017"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jelena Te\u0161i\u0107","raw_affiliation_strings":["Texas State University,Computer Science,San Marcos,TX,USA"],"affiliations":[{"raw_affiliation_string":"Texas State University,Computer Science,San Marcos,TX,USA","institution_ids":["https://openalex.org/I13511017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5123498957"],"corresponding_institution_ids":["https://openalex.org/I13511017"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.67546608,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.38260000944137573,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.38260000944137573,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.18170000612735748,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10286","display_name":"Information Retrieval and Search Behavior","score":0.07410000264644623,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.7930999994277954},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.692799985408783},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5235000252723694},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5170000195503235},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5142999887466431},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.47999998927116394},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.40700000524520874},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.38440001010894775},{"id":"https://openalex.org/keywords/query-expansion","display_name":"Query expansion","score":0.37720000743865967}],"concepts":[{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.7930999994277954},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7584999799728394},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.692799985408783},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5235000252723694},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5170000195503235},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5142999887466431},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.47999998927116394},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4602999985218048},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.40700000524520874},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.38440001010894775},{"id":"https://openalex.org/C99016210","wikidata":"https://www.wikidata.org/wiki/Q5488129","display_name":"Query expansion","level":2,"score":0.37720000743865967},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3249000012874603},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.32089999318122864},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3109000027179718},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.2962999939918518},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.29429998993873596},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.2913999855518341},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2892000079154968},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2865000069141388},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.2770000100135803},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.26499998569488525},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.2597000002861023},{"id":"https://openalex.org/C50897621","wikidata":"https://www.wikidata.org/wiki/Q2665508","display_name":"Hybrid system","level":2,"score":0.25679999589920044}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cbmi66578.2025.11339281","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cbmi66578.2025.11339281","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Conference on Content-Based Multimedia Indexing (CBMI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6340164542198181,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G8103779992","display_name":null,"funder_award_id":"2334268","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W2124509324","https://openalex.org/W2132234208","https://openalex.org/W2133995768","https://openalex.org/W2171572695","https://openalex.org/W2468923260","https://openalex.org/W2744136723","https://openalex.org/W2963213349","https://openalex.org/W2963284996","https://openalex.org/W2963469388","https://openalex.org/W2984806015","https://openalex.org/W2998702515","https://openalex.org/W3007299504","https://openalex.org/W3036320503","https://openalex.org/W3201841349","https://openalex.org/W4290877239","https://openalex.org/W4295885110","https://openalex.org/W4318148014","https://openalex.org/W4387968104","https://openalex.org/W4401385133"],"related_works":[],"abstract_inverted_index":{"With":[0],"the":[1,127],"rapid":[2],"advancement":[3],"of":[4,21],"Large":[5],"Language":[6],"Models":[7],"(LLMs),":[8],"Approximate":[9],"Nearest":[10],"Neighbor":[11],"Search":[12],"(ANNS)":[13],"in":[14,38,138,153],"vector":[15],"databases":[16],"has":[17],"become":[18],"a":[19,56,85,103,119],"cornerstone":[20],"modern":[22],"AI":[23],"infrastructure.":[24],"ANNS":[25,45],"excels":[26],"at":[27],"efficiently":[28,94],"retrieving":[29],"similar":[30],"objects":[31],"from":[32],"billion-scale":[33,96],"datasets,":[34,54],"achieving":[35],"remarkable":[36],"success":[37],"delivering":[39],"fast,":[40],"high-recall":[41],"searches.":[42],"However,":[43],"in-memory":[44],"algorithms":[46],"are":[47],"prohibitively":[48],"expensive":[49],"when":[50],"scaling":[51],"to":[52,93,151],"large":[53],"creating":[55],"growing":[57],"need":[58],"for":[59,74],"cost-effective":[60],"memory-disk":[61,71],"hybrid":[62,72],"solutions.":[63],"This":[64],"paper":[65],"introduces":[66],"BAM-ANN,":[67],"an":[68],"efficient":[69],"graph-based":[70],"solution":[73],"batch":[75],"query":[76,121],"processing.":[77],"Specifically,":[78],"we":[79],"introduce":[80],"three":[81],"key":[82],"innovations:":[83],"(1)":[84],"multi-tiered":[86],"indexing":[87],"strategy":[88],"with":[89],"iterative":[90],"balanced":[91],"clustering":[92],"manage":[95],"data":[97],"under":[98],"limited":[99],"memory":[100],"resources,":[101],"(2)":[102],"learning-driven":[104],"pruning":[105],"mechanism":[106],"that":[107,124,133],"eliminates":[108],"redundant":[109],"I/O":[110],"and":[111,117,147],"computations":[112],"while":[113],"preserving":[114],"high":[115],"accuracy,":[116],"(3)":[118],"batch-aware":[120],"organization":[122],"scheme":[123],"further":[125],"accelerates":[126],"search":[128],"process.":[129],"Experimental":[130],"results":[131],"demonstrate":[132],"BAM-ANN":[134],"achieves":[135],"90%":[136],"recall@100":[137],"approximately":[139],"one":[140],"millisecond,":[141],"outperforming":[142],"state-of-the-art":[143],"solutions":[144],"like":[145],"SPANN":[146],"DiskANN":[148],"by":[149],"1.25x":[150],"2.5x":[152],"speed.":[154]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2026-01-22T00:00:00"}