{"id":"https://openalex.org/W4416051008","doi":"https://doi.org/10.48550/arxiv.2508.15436","title":"On the Effectiveness of Graph Reordering for Accelerating Approximate Nearest Neighbor Search on GPU","display_name":"On the Effectiveness of Graph Reordering for Accelerating Approximate Nearest Neighbor Search on GPU","publication_year":2025,"publication_date":"2025-08-21","ids":{"openalex":"https://openalex.org/W4416051008","doi":"https://doi.org/10.48550/arxiv.2508.15436"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2508.15436","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.15436","pdf_url":"https://arxiv.org/pdf/2508.15436","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2508.15436","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092741852","display_name":"Yutaro Oguri","orcid":"https://orcid.org/0009-0003-9384-2994"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Oguri, Yutaro","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081074221","display_name":"Mai Nishimura","orcid":"https://orcid.org/0000-0003-2859-988X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nishimura, Mai","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5023905620","display_name":"Yusuke Matsui","orcid":"https://orcid.org/0000-0003-1529-0154"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matsui, Yusuke","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5092741852"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.8985999822616577,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.8985999822616577,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.031599998474121094,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.019099999219179153,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.6604999899864197},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5712000131607056},{"id":"https://openalex.org/keywords/graph-layout","display_name":"Graph Layout","score":0.517799973487854},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5005000233650208},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.3765000104904175},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.35519999265670776},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.3271999955177307},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.3160000145435333}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7746999859809875},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.6604999899864197},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5979999899864197},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5712000131607056},{"id":"https://openalex.org/C2911174283","wikidata":"https://www.wikidata.org/wiki/Q739462","display_name":"Graph Layout","level":4,"score":0.517799973487854},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5005000233650208},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.3765000104904175},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.35519999265670776},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3271999955177307},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.3160000145435333},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31049999594688416},{"id":"https://openalex.org/C106937863","wikidata":"https://www.wikidata.org/wiki/Q7236518","display_name":"Power graph analysis","level":3,"score":0.3077999949455261},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.30489999055862427},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.3018999993801117},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29429998993873596},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.29350000619888306},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.2818000018596649},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2808000147342682},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.27300000190734863},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.26420000195503235},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.26170000433921814},{"id":"https://openalex.org/C116409475","wikidata":"https://www.wikidata.org/wiki/Q1385056","display_name":"External Data Representation","level":2,"score":0.2572000026702881},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.257099986076355}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2508.15436","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.15436","pdf_url":"https://arxiv.org/pdf/2508.15436","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2508.15436","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2508.15436","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":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2508.15436","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.15436","pdf_url":"https://arxiv.org/pdf/2508.15436","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416051008.pdf","grobid_xml":"https://content.openalex.org/works/W4416051008.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,82,132],"present":[1],"the":[2,25,99],"first":[3],"systematic":[4],"investigation":[5],"of":[6,55],"graph":[7,61,65,70,79,92],"reordering":[8,57,110],"effects":[9],"for":[10,28],"graph-based":[11,21],"Approximate":[12],"Nearest":[13],"Neighbor":[14],"Search":[15],"(ANNS)":[16],"on":[17,35],"a":[18,64,73,77,84],"GPU.":[19],"While":[20],"ANNS":[22],"has":[23],"become":[24],"dominant":[26],"paradigm":[27],"modern":[29],"AI":[30],"applications,":[31],"recent":[32],"approaches":[33],"focus":[34],"algorithmic":[36,130],"innovations":[37],"while":[38,117],"neglecting":[39],"memory":[40,105,123],"layout":[41,106,124],"considerations":[42],"that":[43,67,97,122],"significantly":[44],"affect":[45],"execution":[46],"time.":[47],"Our":[48,108],"unified":[49],"evaluation":[50,54],"framework":[51],"enables":[52],"comprehensive":[53,85],"diverse":[56,88],"strategies":[58],"across":[59,87],"different":[60],"indices":[62],"through":[63],"adapter":[66],"converts":[68],"arbitrary":[69],"topologies":[71],"into":[72],"common":[74],"representation":[75],"and":[76,90,104,142],"GPU-optimized":[78],"traversal":[80],"engine.":[81],"conduct":[83],"analysis":[86,95],"datasets":[89],"state-of-the-art":[91],"indices,":[93],"introducing":[94],"metrics":[96],"quantify":[98],"relationship":[100],"between":[101],"structural":[102],"properties":[103],"effectiveness.":[107],"GPU-targeted":[109],"achieves":[111],"up":[112],"to":[113,128,139],"15$\\%$":[114],"QPS":[115],"improvements":[116],"preserving":[118],"search":[119],"accuracy,":[120],"demonstrating":[121],"optimization":[125],"operates":[126],"orthogonally":[127],"existing":[129],"innovations.":[131],"will":[133],"release":[134],"all":[135],"code":[136],"upon":[137],"publication":[138],"facilitate":[140],"reproducibility":[141],"foster":[143],"further":[144],"research.":[145]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}