{"id":"https://openalex.org/W4417070391","doi":"https://doi.org/10.1145/3769825","title":"Scalable Graph Indexing using GPUs for Approximate Nearest Neighbor Search","display_name":"Scalable Graph Indexing using GPUs for Approximate Nearest Neighbor Search","publication_year":2025,"publication_date":"2025-12-04","ids":{"openalex":"https://openalex.org/W4417070391","doi":"https://doi.org/10.1145/3769825"},"language":"en","primary_location":{"id":"doi:10.1145/3769825","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3769825","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-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/A5111265760","display_name":"Zhonggen Li","orcid":"https://orcid.org/0009-0002-9693-992X"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhonggen Li","raw_affiliation_strings":["Zhejiang University, Hangzhou, China"],"affiliations":[{"raw_affiliation_string":"Zhejiang University, Hangzhou, China","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071521429","display_name":"Xiangyu Ke","orcid":"https://orcid.org/0000-0001-8082-7398"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiangyu Ke","raw_affiliation_strings":["Zhejiang University, Hangzhou, China"],"affiliations":[{"raw_affiliation_string":"Zhejiang University, Hangzhou, China","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072465669","display_name":"Yifan Zhu","orcid":"https://orcid.org/0000-0003-4555-6232"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yifan Zhu","raw_affiliation_strings":["Zhejiang University, Hangzhou, China"],"affiliations":[{"raw_affiliation_string":"Zhejiang University, Hangzhou, China","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109444192","display_name":"Benliang Yu","orcid":"https://orcid.org/0009-0009-6027-9633"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bocheng Yu","raw_affiliation_strings":["Zhejiang University, Hangzhou, China"],"affiliations":[{"raw_affiliation_string":"Zhejiang University, Hangzhou, China","institution_ids":["https://openalex.org/I76130692"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050328715","display_name":"Baihua Zheng","orcid":"https://orcid.org/0000-0001-9792-9171"},"institutions":[{"id":"https://openalex.org/I79891267","display_name":"Singapore Management University","ror":"https://ror.org/050qmg959","country_code":"SG","type":"education","lineage":["https://openalex.org/I79891267"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Baihua Zheng","raw_affiliation_strings":["Singapore Management University, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Singapore Management University, Singapore, Singapore","institution_ids":["https://openalex.org/I79891267"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006238145","display_name":"Yunjun Gao","orcid":"https://orcid.org/0000-0003-3816-8450"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yunjun Gao","raw_affiliation_strings":["Zhejiang University, Hangzhou, China"],"affiliations":[{"raw_affiliation_string":"Zhejiang University, Hangzhou, China","institution_ids":["https://openalex.org/I76130692"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5111265760"],"corresponding_institution_ids":["https://openalex.org/I76130692"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.40195938,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"6","first_page":"1","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.8751000165939331,"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.8751000165939331,"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/T11106","display_name":"Data Management and Algorithms","score":0.06620000302791595,"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.014800000004470348,"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/search-engine-indexing","display_name":"Search engine indexing","score":0.7760000228881836},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6567999720573425},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6061999797821045},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6011999845504761},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5530999898910522},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5091999769210815},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4853000044822693},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.47350001335144043},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.34450000524520874}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8016999959945679},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.7760000228881836},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6567999720573425},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6061999797821045},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6011999845504761},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5530999898910522},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5091999769210815},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4853000044822693},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.47350001335144043},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37049999833106995},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3513000011444092},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.34450000524520874},{"id":"https://openalex.org/C59276292","wikidata":"https://www.wikidata.org/wiki/Q580427","display_name":"Database index","level":3,"score":0.3409000039100647},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.3375000059604645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3370000123977661},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.33169999718666077},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.3264000117778778},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3109000027179718},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3057999908924103},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.29499998688697815},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.2944999933242798},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.289900004863739},{"id":"https://openalex.org/C2779599972","wikidata":"https://www.wikidata.org/wiki/Q82231","display_name":"NoSQL","level":3,"score":0.28220000863075256},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3769825","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3769825","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2086179657","https://openalex.org/W2963469388","https://openalex.org/W2992678377","https://openalex.org/W2998702515","https://openalex.org/W4250981202","https://openalex.org/W4285355789","https://openalex.org/W4390636178","https://openalex.org/W4400641571"],"related_works":[],"abstract_inverted_index":{"Approximate":[0],"nearest":[1],"neighbor":[2,133,164],"search":[3],"(ANNS)":[4],"in":[5,50,163],"high-dimensional":[6],"vector":[7],"spaces":[8],"has":[9,91],"a":[10,66,75,79,108,125,146,181],"wide":[11],"range":[12],"of":[13,42,94],"real-world":[14,197],"applications.":[15],"Numerous":[16],"methods":[17],"have":[18,28],"been":[19],"proposed":[20],"to":[21,32,63,137,185,204],"handle":[22],"ANNS":[23],"efficiently,":[24],"while":[25,207],"graph-based":[26,43],"indexes":[27,44,98],"gained":[29],"prominence":[30],"due":[31],"their":[33],"high":[34],"accuracy":[35],"and":[36,53,102,129,152],"efficiency.":[37],"However,":[38],"the":[39,121,187,191,209],"indexing":[40,178],"overhead":[41,61],"remains":[45],"substantial.":[46],"With":[47],"exponential":[48],"growth":[49],"data":[51],"volume":[52],"increasing":[54],"demands":[55],"for":[56,111,158],"dynamic":[57],"index":[58,210],"adjustments,":[59],"this":[60,70],"continues":[62],"escalate,":[64],"posing":[65],"critical":[67],"challenge.":[68],"In":[69],"paper,":[71],"we":[72,144,173],"introduce":[73,106],"Tagore,":[74],"fas":[76],"T":[77],"library":[78],"ccelerated":[80],"by":[81,124],"G":[82],"PUs":[83],"f":[84],"or":[85],"graph":[86,97,116,141],"ind":[87],"e":[88],"xing,":[89],"which":[90],"powerful":[92],"capabilities":[93],"constructing":[95],"refinement-based":[96],"such":[99],"as":[100],"NSG":[101],"Vamana.":[103],"We":[104],"first":[105],"GNN-Descent,":[107],"GPU-specific":[109],"algorithm":[110],"efficient":[112],"k-Nearest":[113],"Neighbor":[114],"(k-NN)":[115],"initialization.":[117],"GNN-Descent":[118],"speeds":[119],"up":[120],"similarity":[122],"comparison":[123],"two-phase":[126],"descent":[127],"procedure":[128,149],"enables":[130],"highly":[131],"parallelized":[132],"updates.":[134],"Next,":[135],"aiming":[136],"support":[138],"various":[139],"k-NN":[140],"pruning":[142,148],"strategies,":[143],"formulate":[145],"universal":[147],"termed":[150],"CFS":[151],"devise":[153],"two":[154],"generalized":[155],"GPU":[156,170],"kernels":[157],"parallel":[159],"processing":[160],"complex":[161],"dependencies":[162],"relationships.":[165],"For":[166],"large-scale":[167],"datasets":[168,198],"exceeding":[169],"memory":[171],"capacity,":[172],"propose":[174],"an":[175],"asynchronous":[176],"GPU-CPU-disk":[177],"framework":[179],"with":[180],"cluster-aware":[182],"caching":[183],"mechanism":[184],"minimize":[186],"I/O":[188],"pressure":[189],"on":[190,195],"disk.":[192],"Extensive":[193],"experiments":[194],"7":[196],"exhibit":[199],"that":[200],"Tagore":[201],"achieves":[202],"1.32x":[203],"112.79x":[205],"speedup":[206],"maintaining":[208],"quality.":[211]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-12-06T00:00:00"}