{"id":"https://openalex.org/W7163410481","doi":"https://doi.org/10.48550/arxiv.2606.03151","title":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","display_name":"ACRONYM: Accelerated Approximate Nearest Neighbor Search in Memory for Dynamic Vector Databases","publication_year":2026,"publication_date":"2026-06-02","ids":{"openalex":"https://openalex.org/W7163410481","doi":"https://doi.org/10.48550/arxiv.2606.03151"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.03151","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.03151","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.03151","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037120477","display_name":"Md. Mizanur Rahaman Nayan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nayan, Md Mizanur Rahaman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137715732","display_name":"Tianqi Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Tianqi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082759711","display_name":"Flavio Ponzina","orcid":"https://orcid.org/0000-0002-9662-498X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ponzina, Flavio","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137804229","display_name":"Tajana Rosing","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rosing, Tajana","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5080526846","display_name":"Azad Naeemi","orcid":"https://orcid.org/0000-0003-4774-9046"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Naeemi, Azad J","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.7024000287055969,"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.7024000287055969,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.19599999487400055,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.02850000001490116,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.7458000183105469},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.6779000163078308},{"id":"https://openalex.org/keywords/memory-footprint","display_name":"Memory footprint","score":0.6302000284194946},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.6269000172615051},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5109999775886536},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.43880000710487366},{"id":"https://openalex.org/keywords/precision-and-recall","display_name":"Precision and recall","score":0.42910000681877136},{"id":"https://openalex.org/keywords/bit-array","display_name":"Bit array","score":0.4099999964237213},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.4065000116825104},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.4050999879837036}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.803600013256073},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.7458000183105469},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6779000163078308},{"id":"https://openalex.org/C74912251","wikidata":"https://www.wikidata.org/wiki/Q6815727","display_name":"Memory footprint","level":2,"score":0.6302000284194946},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.6269000172615051},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5949000120162964},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5109999775886536},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.43880000710487366},{"id":"https://openalex.org/C81669768","wikidata":"https://www.wikidata.org/wiki/Q2359161","display_name":"Precision and recall","level":2,"score":0.42910000681877136},{"id":"https://openalex.org/C150807984","wikidata":"https://www.wikidata.org/wiki/Q1992074","display_name":"Bit array","level":3,"score":0.4099999964237213},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.4065000116825104},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.4050999879837036},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.3944000005722046},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.3869999945163727},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.385699987411499},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.3813999891281128},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.3813000023365021},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.36320000886917114},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.35339999198913574},{"id":"https://openalex.org/C482391","wikidata":"https://www.wikidata.org/wiki/Q101244","display_name":"Acronym","level":2,"score":0.33889999985694885},{"id":"https://openalex.org/C33925742","wikidata":"https://www.wikidata.org/wiki/Q361698","display_name":"Page","level":2,"score":0.3240000009536743},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.3167000114917755},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.3098999857902527},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.30559998750686646},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.30480000376701355},{"id":"https://openalex.org/C193524817","wikidata":"https://www.wikidata.org/wiki/Q386780","display_name":"Association rule learning","level":2,"score":0.30250000953674316},{"id":"https://openalex.org/C2781357197","wikidata":"https://www.wikidata.org/wiki/Q5757597","display_name":"High memory","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.29269999265670776},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.29170000553131104},{"id":"https://openalex.org/C89686163","wikidata":"https://www.wikidata.org/wiki/Q1187982","display_name":"Vector space model","level":2,"score":0.2904999852180481},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.28850001096725464},{"id":"https://openalex.org/C82687282","wikidata":"https://www.wikidata.org/wiki/Q66221","display_name":"Auxiliary memory","level":2,"score":0.2865000069141388},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.2847000062465668},{"id":"https://openalex.org/C154504017","wikidata":"https://www.wikidata.org/wiki/Q853614","display_name":"Identifier","level":2,"score":0.28369998931884766},{"id":"https://openalex.org/C83665646","wikidata":"https://www.wikidata.org/wiki/Q42139305","display_name":"Feature vector","level":2,"score":0.28209999203681946},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.27950000762939453},{"id":"https://openalex.org/C132943942","wikidata":"https://www.wikidata.org/wiki/Q2562511","display_name":"Footprint","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.27300000190734863},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.26460000872612},{"id":"https://openalex.org/C105339364","wikidata":"https://www.wikidata.org/wiki/Q2297740","display_name":"Software deployment","level":2,"score":0.25589999556541443}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.03151","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.03151","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.03151","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.03151","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.8958290815353394,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Vector":[0],"database":[1,70,170],"search":[2,32,84,112,116,128],"with":[3,65,183],"frequent":[4,36],"updates":[5],"is":[6,130],"increasingly":[7],"critical":[8],"in":[9,125],"applications":[10],"such":[11,24],"as":[12,25],"retrieval":[13],"augmented":[14],"generation,":[15],"recommendation":[16],"systems,":[17],"and":[18,27,48,81,140,149,190,206],"large-scale":[19],"embedding":[20],"retrieval.":[21],"Existing":[22],"solutions,":[23],"graph-based":[26],"partition-based":[28],"approximate":[29],"nearest":[30],"neighbor":[31],"(ANNS),":[33],"suffer":[34],"from":[35],"index":[37],"rebuilding":[38,51],"due":[39,137],"to":[40,104,121,133,138],"data":[41,79],"distribution-dependent":[42],"indexing":[43],"that":[44,61,113],"impacts":[45],"continuous":[46,145],"deployment":[47],"causes":[49],"long":[50],"latency.":[52],"This":[53],"paper":[54],"proposes":[55],"an":[56,191],"algorithm-hardware":[57],"co-designed":[58],"platform,":[59],"ACRONYM,":[60],"addresses":[62],"key":[63],"problems":[64],"state":[66],"of":[67,78,178,187,195,203,209],"the":[68,106],"art":[69],"search.":[71,108,163],"Algorithmically,":[72],"it":[73],"leverages":[74],"efficient":[75,86,158],"encoding":[76,161],"independent":[77],"distribution":[80],"Hamming-distance":[82],"based":[83,127,154],"for":[85,157],"hardware":[87],"acceleration.":[88],"Architecturally,":[89],"we":[90],"propose":[91,110],"CAM-based":[92],"in-memory":[93],"parallel":[94],"distance":[95],"computation":[96],"followed":[97,117],"by":[98,118],"time":[99],"multiplexed":[100],"approximated":[101],"top-k":[102],"selection":[103],"enable":[105],"exhaustive":[107],"We":[109],"two-stage":[111],"includes":[114],"coarse":[115],"binary":[119],"refinement":[120],"achieve":[122],"high":[123],"recall":[124,174],"CAM":[126],"which":[129],"heavily":[131],"limited":[132],"small":[134],"vector":[135],"dimension":[136],"capacity":[139],"wordline":[141],"parasitic.":[142],"ACRONYM":[143,171],"supports":[144],"update":[146],"without":[147],"stalling":[148],"integrates":[150],"novel":[151],"XOR-and-Accumulate":[152],"(XAC)":[153],"systolic-array":[155],"encoder":[156],"on":[159],"chip":[160],"during":[162],"Across":[164],"million-scale":[165],"datasets,":[166],"while":[167],"serving":[168],"dynamic":[169],"achieves":[172],">90%":[173],"at":[175],"a":[176,184],"throughput":[177],"8e6":[179],"queries":[180],"per":[181,197],"second,":[182],"memory":[185],"footprint":[186],"only":[188],"32MB":[189],"average":[192],"energy":[193],"consumption":[194],"2.56uJ":[196],"query,":[198],"speedup":[199],"over":[200],"HNSW":[201],"(CPU)":[202],"about":[204,210],"400x":[205],"FAISS-IVF":[207],"(GPU)":[208],"80x.":[211]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-04T00:00:00"}