{"id":"https://openalex.org/W4417169883","doi":"https://doi.org/10.1109/icecs66544.2025.11270480","title":"Flattening the Hierarchical Navigable Small World Graph for Efficient Hardware-Based Vector Search","display_name":"Flattening the Hierarchical Navigable Small World Graph for Efficient Hardware-Based Vector Search","publication_year":2025,"publication_date":"2025-11-17","ids":{"openalex":"https://openalex.org/W4417169883","doi":"https://doi.org/10.1109/icecs66544.2025.11270480"},"language":null,"primary_location":{"id":"doi:10.1109/icecs66544.2025.11270480","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icecs66544.2025.11270480","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 32nd IEEE International Conference on Electronics, Circuits and Systems (ICECS)","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/A5102363823","display_name":"Xuyang Xia","orcid":null},"institutions":[{"id":"https://openalex.org/I251738","display_name":"Edinburgh Napier University","ror":"https://ror.org/03zjvnn91","country_code":"GB","type":"education","lineage":["https://openalex.org/I251738"]},{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Xuyang Xia","raw_affiliation_strings":["The University of Edinburgh,Centre for Electronic Frontiers,Edinburgh,Scotland"],"affiliations":[{"raw_affiliation_string":"The University of Edinburgh,Centre for Electronic Frontiers,Edinburgh,Scotland","institution_ids":["https://openalex.org/I98677209","https://openalex.org/I251738"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017301291","display_name":"Alexander Serb","orcid":"https://orcid.org/0000-0002-8034-2398"},"institutions":[{"id":"https://openalex.org/I251738","display_name":"Edinburgh Napier University","ror":"https://ror.org/03zjvnn91","country_code":"GB","type":"education","lineage":["https://openalex.org/I251738"]},{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alexander Serb","raw_affiliation_strings":["The University of Edinburgh,Centre for Electronic Frontiers,Edinburgh,Scotland"],"affiliations":[{"raw_affiliation_string":"The University of Edinburgh,Centre for Electronic Frontiers,Edinburgh,Scotland","institution_ids":["https://openalex.org/I98677209","https://openalex.org/I251738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102363823"],"corresponding_institution_ids":["https://openalex.org/I251738","https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21890889,"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":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.15389999747276306,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10181","display_name":"Natural Language Processing Techniques","score":0.15389999747276306,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.11890000104904175,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.09870000183582306,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/tree-traversal","display_name":"Tree traversal","score":0.7853999733924866},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.6366000175476074},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5971999764442444},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.5863999724388123},{"id":"https://openalex.org/keywords/flattening","display_name":"Flattening","score":0.5546000003814697},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5321000218391418},{"id":"https://openalex.org/keywords/aggregate","display_name":"Aggregate (composite)","score":0.47699999809265137},{"id":"https://openalex.org/keywords/benchmarking","display_name":"Benchmarking","score":0.42570000886917114},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40720000863075256}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7853999733924866},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7074999809265137},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.6366000175476074},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5971999764442444},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.5863999724388123},{"id":"https://openalex.org/C19444555","wikidata":"https://www.wikidata.org/wiki/Q212750","display_name":"Flattening","level":2,"score":0.5546000003814697},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5321000218391418},{"id":"https://openalex.org/C4679612","wikidata":"https://www.wikidata.org/wiki/Q866298","display_name":"Aggregate (composite)","level":2,"score":0.47699999809265137},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.42570000886917114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42480000853538513},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4101000130176544},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40720000863075256},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3492000102996826},{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.3384000062942505},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3296999931335449},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3294000029563904},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.3294000029563904},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3179999887943268},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.2816999852657318},{"id":"https://openalex.org/C81669768","wikidata":"https://www.wikidata.org/wiki/Q2359161","display_name":"Precision and recall","level":2,"score":0.2782000005245209},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.26170000433921814},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2606000006198883},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.2583000063896179},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.2572000026702881},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25369998812675476}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icecs66544.2025.11270480","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icecs66544.2025.11270480","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 32nd IEEE International Conference on Electronics, Circuits and Systems (ICECS)","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":4,"referenced_works":["https://openalex.org/W2124509324","https://openalex.org/W2963469388","https://openalex.org/W3196481040","https://openalex.org/W4391971774"],"related_works":[],"abstract_inverted_index":{"Similarity":[0],"search,":[1],"which":[2,38],"calculates":[3],"proximity":[4],"between":[5],"high-dimensional":[6],"vectors,":[7],"is":[8,24,32,52,58],"extensively":[9],"used":[10],"in":[11,29,97,103],"modern":[12],"data-driven":[13],"applications,":[14],"including":[15],"Large-Language-Models":[16],"(LLMs).":[17],"A":[18,26],"mainstream":[19],"type":[20],"of":[21,110,134],"such":[22],"algorithms":[23],"graph-based.":[25],"state-of-the-art":[27],"algorithm":[28,51,76,122],"this":[30,66],"paradigm":[31],"Hierarchical":[33],"Navigable":[34],"Small":[35],"World":[36],"(HNSW)":[37],"finds":[39],"the":[40,50,75,82,93,108,111,121,135],"nearest":[41],"neighbor":[42],"by":[43,119],"traversing":[44],"through":[45],"a":[46,70,100,124,131],"prebuilt":[47,83],"graph.":[48],"While":[49],"efficient,":[53],"it":[54],"lacks":[55],"parallelism":[56],"and":[57,91,116],"not":[59],"inherently":[60],"suitable":[61],"for":[62,77,99,138],"hardware":[63,78],"acceleration.":[64],"In":[65],"work,":[67],"we":[68,86,129],"conduct":[69],"preliminary":[71],"study":[72],"on":[73],"modifying":[74],"parallelism:":[79],"By":[80],"flattening":[81],"hierarchical":[84],"graph,":[85],"both":[87],"enable":[88],"distributed":[89],"search":[90],"save":[92],"traversal":[94,136],"iterations":[95,137],"required":[96],"exchange":[98],"modest":[101],"increase":[102],"aggregate":[104],"workloads.":[105],"We":[106],"verify":[107],"scalability":[109],"modification":[112],"across":[113],"dataset":[114],"dimensions":[115],"sizes.":[117],"Finally,":[118],"benchmarking":[120],"with":[123],"real":[125],"application":[126],"example":[127],"dataset,":[128],"observe":[130],"2/3":[132],"reduction":[133],"85%":[139],"recall":[140],"accuracy.":[141]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-12-09T00:00:00"}