{"id":"https://openalex.org/W7108356831","doi":"https://doi.org/10.1145/3767695.3769495","title":"On the Interplay Between Graph Quality, Traversal Strategies, and Performance of ANN Retrieval Methods","display_name":"On the Interplay Between Graph Quality, Traversal Strategies, and Performance of ANN Retrieval Methods","publication_year":2025,"publication_date":"2025-12-03","ids":{"openalex":"https://openalex.org/W7108356831","doi":"https://doi.org/10.1145/3767695.3769495"},"language":"en","primary_location":{"id":"doi:10.1145/3767695.3769495","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3767695.3769495","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 Annual International ACM SIGIR Conference on Research and Development in Information Retrieval in the Asia Pacific Region","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://eprints.gla.ac.uk/367343/2/367343.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Hrishikesh Kulkarni","orcid":"https://orcid.org/0009-0007-8900-3118"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hrishikesh Kulkarni","raw_affiliation_strings":["Georgetown University, Washington, DC, USA"],"raw_orcid":"https://orcid.org/0009-0007-8900-3118","affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Sean MacAvaney","orcid":"https://orcid.org/0000-0002-8914-2659"},"institutions":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sean MacAvaney","raw_affiliation_strings":["University of Glasgow, Glasgow, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0002-8914-2659","affiliations":[{"raw_affiliation_string":"University of Glasgow, Glasgow, United Kingdom","institution_ids":["https://openalex.org/I7882870"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Nazli Goharian","orcid":"https://orcid.org/0000-0002-6349-5237"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nazli Goharian","raw_affiliation_strings":["Georgetown University, Washington, DC, USA"],"raw_orcid":"https://orcid.org/0000-0002-6349-5237","affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]},{"author_position":"last","author":{"id":null,"display_name":"Ophir Frieder","orcid":"https://orcid.org/0000-0001-5076-8171"},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ophir Frieder","raw_affiliation_strings":["Georgetown University, Washington, DC, USA"],"raw_orcid":"https://orcid.org/0000-0001-5076-8171","affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, DC, USA","institution_ids":["https://openalex.org/I184565670"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.64680832,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"303","last_page":"312"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10286","display_name":"Information Retrieval and Search Behavior","score":0.7537000179290771,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10286","display_name":"Information Retrieval and Search Behavior","score":0.7537000179290771,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.06809999793767929,"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.040800001472234726,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.656000018119812},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.6359999775886536},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5073000192642212},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.43230000138282776},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.4032000005245209},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.39160001277923584},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.3409999907016754}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7050999999046326},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.656000018119812},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.6359999775886536},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5361999869346619},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5073000192642212},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.43230000138282776},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.4032000005245209},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.39160001277923584},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3790999948978424},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.350600004196167},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3409999907016754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33550000190734863},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.31209999322891235},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3034999966621399},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.2978000044822693},{"id":"https://openalex.org/C5737132","wikidata":"https://www.wikidata.org/wiki/Q1101814","display_name":"Clique-width","level":5,"score":0.28299999237060547},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2662000060081482},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C32946077","wikidata":"https://www.wikidata.org/wiki/Q618079","display_name":"Network analysis","level":2,"score":0.25769999623298645},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.2533000111579895},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2529999911785126}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3767695.3769495","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3767695.3769495","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 Annual International ACM SIGIR Conference on Research and Development in Information Retrieval in the Asia Pacific Region","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.gla.ac.uk:367343","is_oa":true,"landing_page_url":"https://eprints.gla.ac.uk/view/author/60888.html>","pdf_url":"https://eprints.gla.ac.uk/367343/2/367343.pdf","source":{"id":"https://openalex.org/S4210235606","display_name":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","issn_l":"2622-8912","issn":["2622-8912","2622-8920"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Proceedings"}],"best_oa_location":{"id":"pmh:oai:eprints.gla.ac.uk:367343","is_oa":true,"landing_page_url":"https://eprints.gla.ac.uk/view/author/60888.html>","pdf_url":"https://eprints.gla.ac.uk/367343/2/367343.pdf","source":{"id":"https://openalex.org/S4210235606","display_name":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","issn_l":"2622-8912","issn":["2622-8912","2622-8920"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Proceedings"},"sustainable_development_goals":[{"score":0.6878737211227417,"id":"https://metadata.un.org/sdg/1","display_name":"No poverty"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7108356831.pdf","grobid_xml":"https://content.openalex.org/works/W7108356831.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W1662133657","https://openalex.org/W2033912027","https://openalex.org/W2041565863","https://openalex.org/W2132234208","https://openalex.org/W2757662681","https://openalex.org/W2963469388","https://openalex.org/W3021779606","https://openalex.org/W3029693508","https://openalex.org/W3130740619","https://openalex.org/W3154280800","https://openalex.org/W3154755316","https://openalex.org/W3175111331","https://openalex.org/W3194206959","https://openalex.org/W4224308764","https://openalex.org/W4252076394","https://openalex.org/W4282975155","https://openalex.org/W4284663260","https://openalex.org/W4284664419","https://openalex.org/W4284674986","https://openalex.org/W4293057614","https://openalex.org/W4301265533","https://openalex.org/W4320341543","https://openalex.org/W4381329139","https://openalex.org/W4384656680","https://openalex.org/W4391114303","https://openalex.org/W4400909749","https://openalex.org/W4402659550"],"related_works":[],"abstract_inverted_index":{"State-of-the-art":[0],"approximate":[1,119],"nearest":[2],"neighbor":[3],"(ANN)":[4],"methods":[5,127,141,205],"like":[6,206],"HNSW":[7],"and":[8,93,128,136,155,170,196],"LADR":[9,208],"use":[10],"document-document":[11],"proximity":[12],"graphs":[13,124,174,216],"(also":[14],"known":[15],"as":[16],"corpus":[17,63,76,90,109,123],"graphs)":[18],"to":[19,55,84],"identify":[20],"relevant":[21],"documents":[22],"efficiently.":[23],"Complete":[24],"graph":[25,110,158,165,194,197,220],"construction":[26,195,221],"latency":[27],"(though":[28],"built":[29],"offline)":[30],"has":[31],"a":[32,43,69,72,81,89,108],"quadratic":[33],"time":[34],"complexity":[35],"of":[36,39,60,75,138,175,184],"the":[37,57,86,134,182,188],"number":[38],"documents,":[40],"which":[41],"is":[42,80,147],"major":[44],"hurdle":[45],"when":[46,96],"scaling":[47],"these":[48,143,185],"methods.":[49],"Graph":[50],"approximations":[51,66],"are":[52],"popular":[53,139],"ways":[54],"reduce":[56],"computational":[58],"cost":[59],"building":[61],"such":[62],"graphs.":[64,77,144],"However,":[65],"come":[67],"with":[68,98,152],"cost,":[70],"namely,":[71],"lower":[73],"quality":[74,92,215],"Hence,":[78],"there":[79],"practical":[82,190],"need":[83],"understand":[85],"tradeoffs":[87],"between":[88],"graph's":[91],"its":[94],"effectiveness":[95],"used":[97],"various":[99,126,156],"ANN":[100,140,204],"methods;":[101],"in":[102],"other":[103],"words,":[104],"how":[105],"'approximate'":[106],"can":[107],"be":[111],"while":[112,217],"maintaining":[113],"strong":[114],"retrieval":[115,172],"effectiveness?":[116],"We":[117,161,178,200],"construct":[118],"(i.e.":[120],"poorer":[121],"quality)":[122],"using":[125],"present":[129],"extensive":[130],"experiments":[131],"that":[132,202],"analyze":[133,163],"robustness":[135],"performance":[137,212],"on":[142,149,213],"Our":[145],"analysis":[146],"performed":[148],"multiple":[150],"datasets,":[151],"different":[153,164],"parameters":[154],"poor":[157,176,214],"simulation":[159],"strategies.":[160],"also":[162],"traversal":[166,198],"approaches":[167,186],"for":[168],"robust":[169,203],"efficient":[171],"across":[173],"quality.":[177],"conclude":[179],"by":[180,192],"addressing":[181],"utility":[183],"at":[187],"billion-scale,":[189],"scenarios":[191],"optimizing":[193],"stages.":[199],"show":[201,209],"Adaptive":[207],"statistically":[210],"equivalent":[211],"saving":[218],"33%":[219],"time.":[222]},"counts_by_year":[],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-12-03T00:00:00"}