{"id":"https://openalex.org/W3187714972","doi":"https://doi.org/10.24963/ijcai.2021/640","title":"Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks (Extended Abstract)","display_name":"Hierarchical Graph Traversal for Aggregate k Nearest Neighbors Search in Road Networks (Extended Abstract)","publication_year":2021,"publication_date":"2021-08-01","ids":{"openalex":"https://openalex.org/W3187714972","doi":"https://doi.org/10.24963/ijcai.2021/640","mag":"3187714972"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2021/640","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2021/640","pdf_url":"https://www.ijcai.org/proceedings/2021/0640.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2021/0640.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000634517","display_name":"Tenindra Abeywickrama","orcid":"https://orcid.org/0000-0003-1053-2193"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]},{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU","SG"],"is_corresponding":false,"raw_author_name":"Tenindra Abeywickrama","raw_affiliation_strings":["Faculty of Information Technology, Monash University","Grab-NUS AI Lab, National University of Singapore","Grab-NUS AI Lab, National University of Singapore, Singapore","Faculty of Information Technology, Monash University, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Monash University","institution_ids":["https://openalex.org/I56590836"]},{"raw_affiliation_string":"Grab-NUS AI Lab, National University of Singapore","institution_ids":["https://openalex.org/I165932596"]},{"raw_affiliation_string":"Grab-NUS AI Lab, National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]},{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Melbourne, Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047549903","display_name":"Muhammad Aamir Cheema","orcid":"https://orcid.org/0000-0003-2139-9121"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Muhammad Aamir Cheema","raw_affiliation_strings":["Faculty of Information Technology, Monash University","Faculty of Information Technology, Monash University, Melbourne, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Monash University","institution_ids":["https://openalex.org/I56590836"]},{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Melbourne, Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027517542","display_name":"Sabine Storandt","orcid":"https://orcid.org/0000-0001-5411-3834"},"institutions":[{"id":"https://openalex.org/I189712700","display_name":"University of Konstanz","ror":"https://ror.org/0546hnb39","country_code":"DE","type":"education","lineage":["https://openalex.org/I189712700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sabine Storandt","raw_affiliation_strings":["Department of Computer and Information Science, University of Konstanz","Department of Computer and Information Science, University of Konstanz, Konstanz, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, University of Konstanz","institution_ids":["https://openalex.org/I189712700"]},{"raw_affiliation_string":"Department of Computer and Information Science, University of Konstanz, Konstanz, Germany","institution_ids":["https://openalex.org/I189712700"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4491,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.60332244,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"4730","last_page":"4734"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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/T13282","display_name":"Automated Road and Building Extraction","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10757","display_name":"Geographic Information Systems Studies","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7959824800491333},{"id":"https://openalex.org/keywords/aggregate","display_name":"Aggregate (composite)","score":0.782893717288971},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.7446610331535339},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7376934885978699},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6524533629417419},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.516005277633667},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.49519482254981995},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.4348892271518707},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.43424317240715027},{"id":"https://openalex.org/keywords/point-of-interest","display_name":"Point of interest","score":0.4289611577987671},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4043229818344116},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32253414392471313},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2553279399871826}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7959824800491333},{"id":"https://openalex.org/C4679612","wikidata":"https://www.wikidata.org/wiki/Q866298","display_name":"Aggregate (composite)","level":2,"score":0.782893717288971},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.7446610331535339},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7376934885978699},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6524533629417419},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.516005277633667},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.49519482254981995},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.4348892271518707},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.43424317240715027},{"id":"https://openalex.org/C150140777","wikidata":"https://www.wikidata.org/wiki/Q960648","display_name":"Point of interest","level":2,"score":0.4289611577987671},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4043229818344116},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32253414392471313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2553279399871826},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.24963/ijcai.2021/640","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2021/640","pdf_url":"https://www.ijcai.org/proceedings/2021/0640.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},{"id":"pmh:oai:monash.edu:openaire/4d0c47f9-e70f-4e3a-a084-846c45ec6658","is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/4d0c47f9-e70f-4e3a-a084-846c45ec6658","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abeywickrama, T, Cheema, M A & Storandt, S 2021, Hierarchical graph traversal for Aggregate k Nearest Neighbors search in road networks (extended abstract). in Z-H Zhou (ed.), Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI International Joint Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence (AAAI), Marina del Rey CA USA, pp. 4730-4734, International Joint Conference on Artificial Intelligence 2021, Montreal, Quebec, Canada, 19/08/21. https://doi.org/10.24963/ijcai.2021/640","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:monash.edu:publications/4d0c47f9-e70f-4e3a-a084-846c45ec6658","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85125482685&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abeywickrama , T , Cheema , M A & Storandt , S 2021 , Hierarchical graph traversal for Aggregate k Nearest Neighbors search in road networks (extended abstract) . in Z-H Zhou (ed.) , Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence . IJCAI International Joint Conference on Artificial Intelligence , Association for the Advancement of Artificial Intelligence (AAAI) , Marina del Rey CA USA , pp. 4730-4734 , International Joint Conference on Artificial Intelligence 2021 , Montreal , Quebec , Canada , 19/08/21 . https://doi.org/10.24963/ijcai.2021/640","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2021/640","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2021/640","pdf_url":"https://www.ijcai.org/proceedings/2021/0640.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.699999988079071,"id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G1859743012","display_name":null,"funder_award_id":"SPP 1894","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G536225315","display_name":null,"funder_award_id":"FT180100140 and DP180103411","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G5506695369","display_name":"A ubiquitous system for indoor location-based services","funder_award_id":"FT180100140","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"},{"id":"https://openalex.org/G6659126982","display_name":"Next-generation search on social networks","funder_award_id":"DP180103411","funder_id":"https://openalex.org/F4320334704","funder_display_name":"Australian Research Council"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320320971","display_name":"Monash University","ror":"https://ror.org/02bfwt286"},{"id":"https://openalex.org/F4320334704","display_name":"Australian Research Council","ror":"https://ror.org/05mmh0f86"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3187714972.pdf","grobid_xml":"https://content.openalex.org/works/W3187714972.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1580166843","https://openalex.org/W1598088018","https://openalex.org/W1611901023","https://openalex.org/W1977390158","https://openalex.org/W2014889099","https://openalex.org/W2103475593","https://openalex.org/W2118269922","https://openalex.org/W2143709779","https://openalex.org/W2160080073","https://openalex.org/W2257437291","https://openalex.org/W2293808320","https://openalex.org/W2597251875","https://openalex.org/W2602433152","https://openalex.org/W3037451370","https://openalex.org/W4302867431","https://openalex.org/W6635699982"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4252596799","https://openalex.org/W4254594467","https://openalex.org/W4230405657","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W3213135344","https://openalex.org/W170547082","https://openalex.org/W3183956626","https://openalex.org/W2136735429"],"abstract_inverted_index":{"A":[0],"k":[1,7,33,42],"nearest":[2],"neighbors":[3],"(kNN)":[4],"query":[5,26,40],"finds":[6],"closest":[8],"points-of-interest":[9],"(POIs)":[10],"from":[11,62,71],"an":[12,116],"agent's":[13],"location.":[14],"In":[15],"this":[16],"paper,":[17],"we":[18],"study":[19],"a":[20,54,76],"natural":[21],"extension":[22],"of":[23,53,68,118],"the":[24,31,45,50,63],"kNN":[25],"for":[27],"multiple":[28,64],"agents,":[29],"namely,":[30],"Aggregate":[32],"Nearest":[34],"Neighbors":[35],"(AkNN)":[36],"query.":[37],"An":[38],"AkNN":[39,96],"retrieves":[41],"POIs":[43],"with":[44],"smallest":[46],"aggregate":[47,51],"distances":[48,61,70],"where":[49],"distance":[52],"POI":[55],"is":[56],"obtained":[57],"by":[58,113],"aggregating":[59],"its":[60,69],"agents":[65],"(e.g.,":[66],"sum":[67],"each":[72],"agent).":[73],"We":[74],"propose":[75],"novel":[77],"data":[78,104],"structure":[79],"COLT":[80],"(Compacted":[81],"Object-Landmark":[82],"Tree)":[83],"which":[84],"enables":[85],"efficient":[86],"hierarchical":[87],"graph":[88],"traversal":[89],"and":[90,102],"utilize":[91],"it":[92],"to":[93],"efficiently":[94],"answer":[95],"queries.":[97],"Our":[98],"experiments":[99],"on":[100],"real-world":[101],"synthetic":[103],"sets":[105],"show":[106],"that":[107],"our":[108],"techniques":[109],"outperform":[110],"existing":[111],"approaches":[112],"more":[114],"than":[115],"order":[117],"magnitude":[119],"in":[120],"almost":[121],"all":[122],"settings.":[123]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}