{"id":"https://openalex.org/W2149210101","doi":"https://doi.org/10.1145/1559845.1559907","title":"Monitoring path nearest neighbor in road networks","display_name":"Monitoring path nearest neighbor in road networks","publication_year":2009,"publication_date":"2009-06-29","ids":{"openalex":"https://openalex.org/W2149210101","doi":"https://doi.org/10.1145/1559845.1559907","mag":"2149210101"},"language":"en","primary_location":{"id":"doi:10.1145/1559845.1559907","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1559845.1559907","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 ACM SIGMOD International Conference on Management of data","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/A5090624207","display_name":"Zaiben Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I165143802","display_name":"University of Queensland","ror":"https://ror.org/00rqy9422","country_code":"AU","type":"education","lineage":["https://openalex.org/I165143802"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Zaiben Chen","raw_affiliation_strings":["The University of Queensland, Brisbane, Australia"],"affiliations":[{"raw_affiliation_string":"The University of Queensland, Brisbane, Australia","institution_ids":["https://openalex.org/I165143802"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052993469","display_name":"Heng Tao Shen","orcid":"https://orcid.org/0000-0002-2999-2088"},"institutions":[{"id":"https://openalex.org/I165143802","display_name":"University of Queensland","ror":"https://ror.org/00rqy9422","country_code":"AU","type":"education","lineage":["https://openalex.org/I165143802"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Heng Tao Shen","raw_affiliation_strings":["The University of Queensland, Brisbane, Australia"],"affiliations":[{"raw_affiliation_string":"The University of Queensland, Brisbane, Australia","institution_ids":["https://openalex.org/I165143802"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011384237","display_name":"Xiaofang Zhou","orcid":"https://orcid.org/0000-0001-6343-1455"},"institutions":[{"id":"https://openalex.org/I165143802","display_name":"University of Queensland","ror":"https://ror.org/00rqy9422","country_code":"AU","type":"education","lineage":["https://openalex.org/I165143802"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Xiaofang Zhou","raw_affiliation_strings":["The University of Queensland, Brisbane, Australia"],"affiliations":[{"raw_affiliation_string":"The University of Queensland, Brisbane, Australia","institution_ids":["https://openalex.org/I165143802"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075642293","display_name":"Jeffrey Xu Yu","orcid":"https://orcid.org/0000-0002-9738-827X"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jeffrey Xu Yu","raw_affiliation_strings":["The Chinese University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5090624207"],"corresponding_institution_ids":["https://openalex.org/I165143802"],"apc_list":null,"apc_paid":null,"fwci":13.2723,"has_fulltext":false,"cited_by_count":99,"citation_normalized_percentile":{"value":0.99335857,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"591","last_page":"602"},"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/T12016","display_name":"Web Data Mining and Analysis","score":0.9781000018119812,"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/T10757","display_name":"Geographic Information Systems Studies","score":0.9739000201225281,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7525091171264648},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.745939314365387},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6822769045829773},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5568698048591614},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5559622049331665},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5121011734008789},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.43647706508636475},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.42201468348503113},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.418569952249527},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.41705167293548584},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3762103319168091},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21568724513053894},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1924058198928833},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19202303886413574}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7525091171264648},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.745939314365387},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6822769045829773},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5568698048591614},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5559622049331665},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5121011734008789},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.43647706508636475},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.42201468348503113},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.418569952249527},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.41705167293548584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3762103319168091},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21568724513053894},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1924058198928833},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19202303886413574},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1559845.1559907","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1559845.1559907","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2009 ACM SIGMOD International Conference on Management of data","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-108421","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-108421","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference paper"},{"id":"pmh:oai:repository.ust.hk:1783.1-108421","is_oa":false,"landing_page_url":"http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=&rft.volume=&rft.issue=&rft.date=2009&rft.spage=591&rft.aulast=Chen&rft.aufirst=&rft.atitle=Monitoring+path+nearest+neighbor+in+road+networks&rft.title=SIGMOD-PODS%2709+-+Proceedings+of+the+International+Conference+on+Management+of+Data+and+28th+Symposium+on+Principles+of+Database+Systems","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.5299999713897705,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1500873048","https://openalex.org/W1543003006","https://openalex.org/W1829285201","https://openalex.org/W1965469937","https://openalex.org/W1969483458","https://openalex.org/W1990111898","https://openalex.org/W2002471647","https://openalex.org/W2014889099","https://openalex.org/W2046144220","https://openalex.org/W2059378307","https://openalex.org/W2060029502","https://openalex.org/W2074989152","https://openalex.org/W2114004713","https://openalex.org/W2123125532","https://openalex.org/W2131796944","https://openalex.org/W2134780295","https://openalex.org/W2143709779","https://openalex.org/W2146485383","https://openalex.org/W2151369660","https://openalex.org/W2168872671","https://openalex.org/W2169336598","https://openalex.org/W2169528473","https://openalex.org/W2171901130","https://openalex.org/W2784746720","https://openalex.org/W4206499008","https://openalex.org/W6679618541"],"related_works":["https://openalex.org/W2148008870","https://openalex.org/W2381195555","https://openalex.org/W2368606575","https://openalex.org/W4246757943","https://openalex.org/W2132753198","https://openalex.org/W2369874856","https://openalex.org/W2182477562","https://openalex.org/W2792185758","https://openalex.org/W2787484455","https://openalex.org/W2119808169"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,7,32,37,41,44,60,68,75,84,87,96,107,113,127,130,135,138,141,145,156,161,166,179,188,205,213,224,231,240,244],"problem":[4],"of":[5,53,94,190],"monitoring":[6,95,126,194],"k":[8],"nearest":[9,54],"neighbors":[10],"to":[11,36,104,144,154,178],"a":[12,20,23,51,118,149,169,217],"dynamically":[13,105],"changing":[14],"path":[15,39,89,143,242],"in":[16,165,187,207],"road":[17,254],"networks.":[18],"Given":[19],"destination":[21,42],"where":[22],"user":[24,76,102,209],"is":[25,77,103,158,216],"going":[26],"to,":[27],"this":[28,66],"new":[29],"query":[30,67,72,88,180],"returns":[31],"k-NN":[33],"with":[34,197],"respect":[35],"shortest":[38,85,132,142,241],"connecting":[40],"and":[43,48,79,110,129,182,223,243,256],"user's":[45],"current":[46],"location,":[47],"thus":[49],"provides":[50],"list":[52],"candidates":[55],"for":[56,98,125,173],"reference":[57],"by":[58,230],"considering":[59],"whole":[61],"coming":[62],"journey.":[63],"We":[64,116],"name":[65],"k-Path":[69],"Nearest":[70],"Neighbor":[71],"(k-PNN).":[73],"As":[74],"moving":[78,101],"may":[80],"not":[81],"always":[82],"follow":[83],"path,":[86,181],"keeps":[90],"changing.":[91],"The":[92,193],"challenge":[93],"k-PNN":[97,114,128,157,206,245],"an":[99,220],"arbitrarily":[100],"determine":[106],"update":[108,199,238],"locations":[109,200],"then":[111],"refresh":[112],"efficiently.":[115],"propose":[117],"three-phase":[119],"Best-first":[120],"Network":[121],"Expansion":[122],"(BNE)":[123],"algorithm":[124,171],"corresponding":[131],"path.":[133],"In":[134],"searching":[136],"phase,":[137,168],"BNE":[139,232],"finds":[140],"destination,":[146],"during":[147],"which":[148,234],"candidate":[150,225],"set":[151,226],"that":[152,258],"guarantees":[153],"include":[155],"generated":[159],"at":[160],"same":[162],"time.":[163],"Then":[164],"verification":[167],"heuristic":[170],"runs":[172],"examining":[174],"candidates'":[175],"exact":[176],"distances":[177],"it":[183],"achieves":[184],"significant":[185],"reduction":[186],"number":[189],"visited":[191],"nodes.":[192],"phase":[195],"deals":[196],"computing":[198],"as":[201,203],"well":[202],"refreshing":[204],"different":[208],"movements.":[210],"Since":[211],"determining":[212],"network":[214],"distance":[215],"costly":[218],"process,":[219],"expansion":[221],"tree":[222],"are":[227],"carefully":[228],"maintained":[229],"algorithm,":[233],"can":[235],"provide":[236],"efficient":[237],"on":[239,252],"results.":[246],"Finally,":[247],"we":[248],"conduct":[249],"extensive":[250],"experiments":[251],"real":[253],"networks":[255],"show":[257],"our":[259],"methods":[260],"achieve":[261],"satisfactory":[262],"performance.":[263]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":14},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":14}],"updated_date":"2026-04-01T17:29:45.350535","created_date":"2025-10-10T00:00:00"}