{"id":"https://openalex.org/W7134928809","doi":"https://doi.org/10.1109/asp-dac66049.2026.11420804","title":"SpANNS: Optimizing Approximate Nearest Neighbor Search for Sparse Vectors Using Near Memory Processing","display_name":"SpANNS: Optimizing Approximate Nearest Neighbor Search for Sparse Vectors Using Near Memory Processing","publication_year":2026,"publication_date":"2026-01-19","ids":{"openalex":"https://openalex.org/W7134928809","doi":"https://doi.org/10.1109/asp-dac66049.2026.11420804"},"language":null,"primary_location":{"id":"doi:10.1109/asp-dac66049.2026.11420804","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asp-dac66049.2026.11420804","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 31st Asia and South Pacific Design Automation Conference (ASP-DAC)","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/A5128750353","display_name":"Tianqi Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tianqi Zhang","raw_affiliation_strings":["University of California,San Diego"],"affiliations":[{"raw_affiliation_string":"University of California,San Diego","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082759711","display_name":"Flavio Ponzina","orcid":"https://orcid.org/0000-0002-9662-498X"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Flavio Ponzina","raw_affiliation_strings":["University of California,San Diego"],"affiliations":[{"raw_affiliation_string":"University of California,San Diego","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5128742874","display_name":"Tajana Rosing","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tajana Rosing","raw_affiliation_strings":["University of California,San Diego"],"affiliations":[{"raw_affiliation_string":"University of California,San Diego","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5128750353"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.91463415,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"688","last_page":"695"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.44369998574256897,"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.44369998574256897,"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.16439999639987946,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.051500000059604645,"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/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.5019000172615051},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.41339999437332153},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.36649999022483826},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.30379998683929443},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.29339998960494995}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6137999892234802},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.503600001335144},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.5019000172615051},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48649999499320984},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.41339999437332153},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.36649999022483826},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.30379998683929443},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.29339998960494995},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.27730000019073486},{"id":"https://openalex.org/C104267543","wikidata":"https://www.wikidata.org/wiki/Q208163","display_name":"Signal processing","level":3,"score":0.27239999175071716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2612999975681305},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.2612999975681305}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/asp-dac66049.2026.11420804","is_oa":false,"landing_page_url":"https://doi.org/10.1109/asp-dac66049.2026.11420804","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 31st Asia and South Pacific Design Automation Conference (ASP-DAC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W2041811089","https://openalex.org/W2063694594","https://openalex.org/W2154610494","https://openalex.org/W2270203991","https://openalex.org/W2346205343","https://openalex.org/W2799244653","https://openalex.org/W2963469388","https://openalex.org/W2982008795","https://openalex.org/W2998702515","https://openalex.org/W3034912391","https://openalex.org/W3154280800","https://openalex.org/W3174809957","https://openalex.org/W3206770993","https://openalex.org/W4280568654","https://openalex.org/W4284663260","https://openalex.org/W4321466355","https://openalex.org/W4384523577","https://openalex.org/W4386763970","https://openalex.org/W4387064022","https://openalex.org/W4388757726","https://openalex.org/W4396821195","https://openalex.org/W4397004836","https://openalex.org/W4400529706","https://openalex.org/W4400879993","https://openalex.org/W4400909749","https://openalex.org/W4401212085","https://openalex.org/W4411471852","https://openalex.org/W7133185626"],"related_works":[],"abstract_inverted_index":{"Approximate":[0],"Nearest":[1],"Neighbor":[2],"Search":[3],"(ANNS)":[4],"is":[5,40,82],"a":[6,60,69,85,91],"fundamental":[7],"operation":[8],"in":[9,16,52],"vector":[10,134],"databases,":[11],"enabling":[12],"efficient":[13,74,130],"similarity":[14],"search":[15],"high-dimensional":[17],"spaces.":[18],"While":[19],"dense":[20,49],"ANNS":[21,30],"has":[22],"been":[23],"optimized":[24],"using":[25],"specialized":[26,92],"hardware":[27],"accelerators,":[28],"sparse":[29,47,65,133],"remains":[31],"limited":[32],"by":[33],"CPU-based":[34],"implementations,":[35],"hindering":[36],"scalability.":[37],"This":[38],"limitation":[39],"increasingly":[41],"critical":[42],"as":[43],"hybrid":[44,70],"retrieval":[45],"systems\u2014combining":[46],"and":[48,77,97,106,129],"embeddings\u2014become":[50],"standard":[51],"Information":[53],"Retrieval":[54],"(IR)":[55],"pipelines.":[56],"We":[57],"propose":[58],"SpANNS,":[59],"near-memory":[61,88],"processing":[62],"architecture":[63,81],"for":[64,132],"ANNS.":[66],"SpANNS":[67],"combines":[68],"inverted":[71],"index":[72,104],"with":[73],"query":[75,95],"management":[76],"runtime":[78],"optimizations.":[79],"The":[80],"built":[83],"on":[84],"CXL":[86],"Type-2":[87],"platform,":[89],"where":[90],"controller":[93],"manages":[94],"parsing":[96],"cluster":[98],"filtering,":[99],"while":[100],"compute-enabled":[101],"DIMMs":[102],"perform":[103],"traversal":[105],"distance":[107],"computations":[108],"close":[109],"to":[110,117],"the":[111,123],"data.":[112],"It":[113],"achieves":[114],"$15.2":[115],"\\times$":[116,119],"$21.6":[118],"faster":[120],"execution":[121],"over":[122],"state-of-the-art":[124],"CPU":[125],"baselines,":[126],"offering":[127],"scalable":[128],"solutions":[131],"search.":[135]},"counts_by_year":[],"updated_date":"2026-03-13T14:20:09.374765","created_date":"2026-03-12T00:00:00"}