{"id":"https://openalex.org/W4414360484","doi":"https://doi.org/10.24963/ijcai.2025/339","title":"App2Exa: Accelerating Exact kNN Search via Dynamic Cache-Guided Approximation","display_name":"App2Exa: Accelerating Exact kNN Search via Dynamic Cache-Guided Approximation","publication_year":2025,"publication_date":"2025-09-01","ids":{"openalex":"https://openalex.org/W4414360484","doi":"https://doi.org/10.24963/ijcai.2025/339"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2025/339","is_oa":false,"landing_page_url":"https://doi.org/10.24963/ijcai.2025/339","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","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/A5100343462","display_name":"Ke Li","orcid":"https://orcid.org/0000-0001-9206-0892"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Ke Li","raw_affiliation_strings":["University of Electronic Science and Technology of China"],"affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035706700","display_name":"Leong Hou U","orcid":"https://orcid.org/0000-0002-5135-5165"},"institutions":[{"id":"https://openalex.org/I204512498","display_name":"University of Macau","ror":"https://ror.org/01r4q9n85","country_code":"MO","type":"education","lineage":["https://openalex.org/I204512498"]}],"countries":["MO"],"is_corresponding":false,"raw_author_name":"Leong Hou U","raw_affiliation_strings":["University of Macau"],"affiliations":[{"raw_affiliation_string":"University of Macau","institution_ids":["https://openalex.org/I204512498"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102754146","display_name":"Shuo Shang","orcid":"https://orcid.org/0000-0002-1117-2890"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shuo Shang","raw_affiliation_strings":["University of Electronic Science and Technology of China"],"affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China","institution_ids":["https://openalex.org/I150229711"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100343462"],"corresponding_institution_ids":["https://openalex.org/I150229711"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29299904,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3045","last_page":"3053"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9822999835014343,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9822999835014343,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9645000100135803,"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"}},{"id":"https://openalex.org/T12127","display_name":"Software System Performance and Reliability","score":0.9340999722480774,"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/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.7117999792098999},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.64410001039505},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4235000014305115},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.3750999867916107},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3458000123500824},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.32260000705718994},{"id":"https://openalex.org/keywords/online-analytical-processing","display_name":"Online analytical processing","score":0.3206000030040741},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.3118000030517578}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7534999847412109},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.7117999792098999},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.64410001039505},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4300999939441681},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4235000014305115},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41200000047683716},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.3750999867916107},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3458000123500824},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32589998841285706},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.32260000705718994},{"id":"https://openalex.org/C201932085","wikidata":"https://www.wikidata.org/wiki/Q642514","display_name":"Online analytical processing","level":3,"score":0.3206000030040741},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.3118000030517578},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.3116999864578247},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.3059000074863434},{"id":"https://openalex.org/C2989070954","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database query","level":2,"score":0.3027999997138977},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.2992999851703644},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.2919999957084656},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.288100004196167},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C67186912","wikidata":"https://www.wikidata.org/wiki/Q367664","display_name":"Data modeling","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.2685000002384186}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2025/339","is_oa":false,"landing_page_url":"https://doi.org/10.24963/ijcai.2025/339","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","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":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"k-nearest":[1],"neighbor":[2],"(kNN)":[3],"query":[4,40,60,136],"is":[5],"a":[6,46,69,81,97,100,129],"cornerstone":[7],"of":[8],"similarity-based":[9],"applications":[10],"across":[11],"various":[12],"domains.":[13],"While":[14],"prior":[15],"work":[16],"has":[17],"enhanced":[18],"kNN":[19,52,77,141],"search":[20,53,95,142],"efficiency,":[21,127],"it":[22],"typically":[23],"focuses":[24],"on":[25,114],"approximate":[26,74,89],"methods":[27,33],"for":[28,34,54,134],"high-dimensional":[29],"data":[30,42,57],"or":[31],"exact":[32,51,76,94,140],"low-dimensional":[35],"data,":[36],"often":[37],"assuming":[38],"static":[39],"and":[41,75,117,131,138],"distributions.":[43,61],"This":[44],"creates":[45],"significant":[47],"gap":[48],"in":[49],"accelerating":[50],"low-to-medium":[55],"dimensional":[56],"with":[58,99],"dynamic":[59],"To":[62],"fill":[63],"this":[64],"gap,":[65],"we":[66],"propose":[67],"App2Exa,":[68],"cache-guided":[70],"framework":[71],"that":[72,123],"integrates":[73],"search.":[78],"App2Exa":[79,124],"utilizes":[80],"dynamically":[82],"maintained":[83],"cache":[84],"graph":[85],"index":[86],"to":[87,143],"retrieve":[88],"results,":[90],"which":[91],"subsequently":[92],"guide":[93],"using":[96],"VP-Tree":[98],"best-first":[101],"strategy.":[102],"A":[103],"benefit-driven":[104],"caching":[105],"mechanism":[106],"further":[107],"optimizes":[108],"performance":[109],"by":[110],"prioritizing":[111],"vectors":[112],"based":[113],"frequency,":[115],"recency,":[116],"computational":[118],"cost.":[119],"Experimental":[120],"results":[121],"demonstrate":[122],"significantly":[125],"boosts":[126],"providing":[128],"robust":[130],"scalable":[132],"solution":[133],"evolving":[135],"patterns":[137],"enabling":[139],"support":[144],"higher":[145],"dimensionality":[146],"more":[147],"effectively.":[148]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}