{"id":"https://openalex.org/W2136818371","doi":"https://doi.org/10.1142/s0219265908002382","title":"INCREMENTAL <font>K</font>-NEAREST-NEIGHBOR SEARCH ON ROAD NETWORKS","display_name":"INCREMENTAL <font>K</font>-NEAREST-NEIGHBOR SEARCH ON ROAD NETWORKS","publication_year":2008,"publication_date":"2008-12-01","ids":{"openalex":"https://openalex.org/W2136818371","doi":"https://doi.org/10.1142/s0219265908002382","mag":"2136818371"},"language":"en","primary_location":{"id":"doi:10.1142/s0219265908002382","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265908002382","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","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/A5100867302","display_name":"Geng Zhao","orcid":"https://orcid.org/0009-0003-7037-805X"},"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":"GENG ZHAO","raw_affiliation_strings":["Clayton School of Information Technology, Monash University, Australia","Clayton School of Information Technology , Monash University , Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Clayton School of Information Technology, Monash University, Australia","institution_ids":["https://openalex.org/I56590836"]},{"raw_affiliation_string":"Clayton School of Information Technology , Monash University , Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045072925","display_name":"Kefeng Xuan","orcid":null},"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":"KEFENG XUAN","raw_affiliation_strings":["Clayton School of Information Technology, Monash University, Australia","Clayton School of Information Technology , Monash University , Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Clayton School of Information Technology, Monash University, Australia","institution_ids":["https://openalex.org/I56590836"]},{"raw_affiliation_string":"Clayton School of Information Technology , Monash University , Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065353209","display_name":"David Taniar","orcid":"https://orcid.org/0000-0002-8862-3960"},"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":"DAVID TANIAR","raw_affiliation_strings":["Clayton School of Information Technology, Monash University, Australia","Clayton School of Information Technology , Monash University , Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Clayton School of Information Technology, Monash University, Australia","institution_ids":["https://openalex.org/I56590836"]},{"raw_affiliation_string":"Clayton School of Information Technology , Monash University , Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109937874","display_name":"Bala Srinivasan","orcid":null},"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":"BALA SRINIVASAN","raw_affiliation_strings":["Clayton School of Information Technology, Monash University, Australia","Clayton School of Information Technology , Monash University , Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Clayton School of Information Technology, Monash University, Australia","institution_ids":["https://openalex.org/I56590836"]},{"raw_affiliation_string":"Clayton School of Information Technology , Monash University , Australia","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.7036,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.96480938,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"09","issue":"04","first_page":"455","last_page":"470"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"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":1.0,"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.9965000152587891,"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.9926999807357788,"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/computer-science","display_name":"Computer science","score":0.6955008506774902},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6649537086486816},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6343599557876587},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6103958487510681},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5800368189811707},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5553010106086731},{"id":"https://openalex.org/keywords/point-of-interest","display_name":"Point of interest","score":0.5209373235702515},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.49872398376464844},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.47884082794189453},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.47872114181518555},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.466065913438797},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45320984721183777},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.44795385003089905},{"id":"https://openalex.org/keywords/query-expansion","display_name":"Query expansion","score":0.41056472063064575},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4073490500450134},{"id":"https://openalex.org/keywords/web-query-classification","display_name":"Web query classification","score":0.4006000757217407},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.38598135113716125},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33249834179878235},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.32533758878707886},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.24770864844322205},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23510512709617615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21540361642837524},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.17745882272720337},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06449800729751587}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6955008506774902},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6649537086486816},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6343599557876587},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6103958487510681},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5800368189811707},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5553010106086731},{"id":"https://openalex.org/C150140777","wikidata":"https://www.wikidata.org/wiki/Q960648","display_name":"Point of interest","level":2,"score":0.5209373235702515},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.49872398376464844},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.47884082794189453},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.47872114181518555},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.466065913438797},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45320984721183777},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.44795385003089905},{"id":"https://openalex.org/C99016210","wikidata":"https://www.wikidata.org/wiki/Q5488129","display_name":"Query expansion","level":2,"score":0.41056472063064575},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4073490500450134},{"id":"https://openalex.org/C118689300","wikidata":"https://www.wikidata.org/wiki/Q7978614","display_name":"Web query classification","level":4,"score":0.4006000757217407},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.38598135113716125},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33249834179878235},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.32533758878707886},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.24770864844322205},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23510512709617615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21540361642837524},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.17745882272720337},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06449800729751587},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0219265908002382","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265908002382","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Interconnection Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6399999856948853}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W54681447","https://openalex.org/W125375360","https://openalex.org/W1543003006","https://openalex.org/W1996888505","https://openalex.org/W2004161795","https://openalex.org/W2011954741","https://openalex.org/W2014789398","https://openalex.org/W2050384762","https://openalex.org/W2086306243","https://openalex.org/W2093049220","https://openalex.org/W2099747310","https://openalex.org/W2105264620","https://openalex.org/W2106796921","https://openalex.org/W2118269922","https://openalex.org/W2149441220","https://openalex.org/W2162866792","https://openalex.org/W2169528473","https://openalex.org/W4239339957"],"related_works":["https://openalex.org/W2795392346","https://openalex.org/W4246757943","https://openalex.org/W2969538544","https://openalex.org/W1595303882","https://openalex.org/W2182477562","https://openalex.org/W2132753198","https://openalex.org/W2405216906","https://openalex.org/W924614198","https://openalex.org/W1558159560","https://openalex.org/W2011582495"],"abstract_inverted_index":{"Most":[0],"query":[1,58,73,117,129,136,141],"search":[2],"on":[3,24,123],"road":[4,27],"networks":[5],"is":[6,86,94,121,156],"either":[7],"to":[8,18,107,175],"find":[9,19,66],"objects":[10,64,79,111],"within":[11],"a":[12,35,51,57,67,95,135],"certain":[13],"range":[14],"(range":[15],"search)":[16],"or":[17,147],"K":[20],"nearest":[21,42,184],"neighbors":[22],"(KNN)":[23],"the":[25,61,72,81,87,116,125,128,132,140,160,169,172,177],"actual":[26],"network":[28,126,145],"map.":[29],"In":[30],"this":[31,84,154],"paper,":[32],"we":[33,105],"propose":[34],"novel":[36],"query,":[37,99],"that":[38],"is,":[39],"incremental":[40,182],"k":[41,77,109,183],"neighbor":[43],"(iKNN).":[44],"iKNN":[45],"can":[46,101],"be":[47,102],"defined":[48],"as":[49],"given":[50],"set":[52,137,142],"of":[53,63,83,98,153,171],"candidate":[54],"interest":[55,78,110,148],"objects,":[56],"point":[59],"and":[60,80,138,159],"number":[62],"k,":[65],"path":[68,85],"which":[69,100,179],"starts":[70],"at":[71],"point,":[74,130],"goes":[75],"through":[76],"distance":[82],"shortest":[88],"among":[89],"all":[90],"possible":[91],"paths.":[92],"This":[93,119],"new":[96],"type":[97],"used":[103],"when":[104,143],"want":[106],"visit":[108],"one":[112,114],"by":[113],"from":[115,127],"point.":[118],"approach":[120,155,174],"based":[122],"expanding":[124],"keeping":[131],"results":[133],"in":[134],"updating":[139],"reaching":[144],"intersection":[146],"objects.":[149],"The":[150],"basic":[151],"theory":[152],"Dijkstra's":[157],"algorithm":[158],"Incremental":[161],"Network":[162],"Expansion":[163],"(INE)":[164],"algorithm.":[165],"Our":[166],"experiment":[167],"verified":[168],"applicability":[170],"proposed":[173],"solve":[176],"queries,":[178],"involve":[180],"finding":[181],"neighbor.":[185]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}