{"id":"https://openalex.org/W2565025040","doi":"https://doi.org/10.3390/ijgi5120247","title":"Efficient Processing of Continuous Reverse k Nearest Neighbor on Moving Objects in Road Networks","display_name":"Efficient Processing of Continuous Reverse k Nearest Neighbor on Moving Objects in Road Networks","publication_year":2016,"publication_date":"2016-12-20","ids":{"openalex":"https://openalex.org/W2565025040","doi":"https://doi.org/10.3390/ijgi5120247","mag":"2565025040"},"language":"en","primary_location":{"id":"doi:10.3390/ijgi5120247","is_oa":true,"landing_page_url":"https://doi.org/10.3390/ijgi5120247","pdf_url":"https://www.mdpi.com/2220-9964/5/12/247/pdf?version=1482223641","source":{"id":"https://openalex.org/S2764431341","display_name":"ISPRS International Journal of Geo-Information","issn_l":"2220-9964","issn":["2220-9964"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ISPRS International Journal of Geo-Information","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/2220-9964/5/12/247/pdf?version=1482223641","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060212021","display_name":"Muhammad Attique","orcid":"https://orcid.org/0000-0002-7237-180X"},"institutions":[{"id":"https://openalex.org/I57664883","display_name":"Ajou University","ror":"https://ror.org/03tzb2h73","country_code":"KR","type":"education","lineage":["https://openalex.org/I57664883"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Muhammad Attique","raw_affiliation_strings":["Department of Computer Engineering, Ajou University, Suwon 16499, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Ajou University, Suwon 16499, Korea","institution_ids":["https://openalex.org/I57664883"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103078027","display_name":"Hyung-Ju Cho","orcid":"https://orcid.org/0000-0001-7458-8888"},"institutions":[{"id":"https://openalex.org/I31419693","display_name":"Kyungpook National University","ror":"https://ror.org/040c17130","country_code":"KR","type":"education","lineage":["https://openalex.org/I31419693"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyung-Ju Cho","raw_affiliation_strings":["Department of Software, Kyungpook National University, Sangju-si 37224, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Software, Kyungpook National University, Sangju-si 37224, Korea","institution_ids":["https://openalex.org/I31419693"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022686531","display_name":"Rize Jin","orcid":"https://orcid.org/0000-0001-5537-0744"},"institutions":[{"id":"https://openalex.org/I57664883","display_name":"Ajou University","ror":"https://ror.org/03tzb2h73","country_code":"KR","type":"education","lineage":["https://openalex.org/I57664883"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Rize Jin","raw_affiliation_strings":["Department of Computer Engineering, Ajou University, Suwon 16499, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Ajou University, Suwon 16499, Korea","institution_ids":["https://openalex.org/I57664883"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044985062","display_name":"Tae\u2010Sun Chung","orcid":"https://orcid.org/0000-0001-5992-1136"},"institutions":[{"id":"https://openalex.org/I57664883","display_name":"Ajou University","ror":"https://ror.org/03tzb2h73","country_code":"KR","type":"education","lineage":["https://openalex.org/I57664883"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Tae-Sun Chung","raw_affiliation_strings":["Department of Computer Engineering, Ajou University, Suwon 16499, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Ajou University, Suwon 16499, Korea","institution_ids":["https://openalex.org/I57664883"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5044985062"],"corresponding_institution_ids":["https://openalex.org/I57664883"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.7637,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.73820948,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"5","issue":"12","first_page":"247","last_page":"247"},"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.994700014591217,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9822999835014343,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.7865973711013794},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7407385110855103},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.6978042125701904},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.6133584380149841},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.5807698369026184},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.558013916015625},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5518204569816589},{"id":"https://openalex.org/keywords/nearest-neighbor-graph","display_name":"Nearest neighbor graph","score":0.5455030202865601},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.5423094034194946},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5416709184646606},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.525152862071991},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5087407231330872},{"id":"https://openalex.org/keywords/fixed-radius-near-neighbors","display_name":"Fixed-radius near neighbors","score":0.42783883213996887},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31604844331741333},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2620794177055359},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1364521086215973},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.07299166917800903}],"concepts":[{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.7865973711013794},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7407385110855103},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.6978042125701904},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.6133584380149841},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.5807698369026184},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.558013916015625},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5518204569816589},{"id":"https://openalex.org/C90988772","wikidata":"https://www.wikidata.org/wiki/Q2855103","display_name":"Nearest neighbor graph","level":3,"score":0.5455030202865601},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.5423094034194946},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5416709184646606},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.525152862071991},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5087407231330872},{"id":"https://openalex.org/C46264003","wikidata":"https://www.wikidata.org/wiki/Q5456333","display_name":"Fixed-radius near neighbors","level":5,"score":0.42783883213996887},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31604844331741333},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2620794177055359},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1364521086215973},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.07299166917800903},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"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.3390/ijgi5120247","is_oa":true,"landing_page_url":"https://doi.org/10.3390/ijgi5120247","pdf_url":"https://www.mdpi.com/2220-9964/5/12/247/pdf?version=1482223641","source":{"id":"https://openalex.org/S2764431341","display_name":"ISPRS International Journal of Geo-Information","issn_l":"2220-9964","issn":["2220-9964"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ISPRS International Journal of Geo-Information","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:e534cdb7e82644fbb82c78b3a79a4cd5","is_oa":true,"landing_page_url":"https://doaj.org/article/e534cdb7e82644fbb82c78b3a79a4cd5","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"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":"ISPRS International Journal of Geo-Information, Vol 5, Iss 12, p 247 (2016)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/2220-9964/5/12/247/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/ijgi5120247","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISPRS International Journal of Geo-Information; Volume 5; Issue 12; Pages: 247","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/ijgi5120247","is_oa":true,"landing_page_url":"https://doi.org/10.3390/ijgi5120247","pdf_url":"https://www.mdpi.com/2220-9964/5/12/247/pdf?version=1482223641","source":{"id":"https://openalex.org/S2764431341","display_name":"ISPRS International Journal of Geo-Information","issn_l":"2220-9964","issn":["2220-9964"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ISPRS International Journal of Geo-Information","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6499999761581421}],"awards":[{"id":"https://openalex.org/G1776078449","display_name":null,"funder_award_id":"2013R1A1A2A10012956","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G3034753964","display_name":null,"funder_award_id":"grant","funder_id":"https://openalex.org/F4320320671","funder_display_name":"National Research Foundation"},{"id":"https://openalex.org/G342704958","display_name":null,"funder_award_id":"funded","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G3494007552","display_name":null,"funder_award_id":"NRF-2012","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G3942910960","display_name":null,"funder_award_id":"(NRF) grant","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G4244126222","display_name":null,"funder_award_id":"NRF-2016","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G5334778219","display_name":null,"funder_award_id":"and NRF-","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G628659092","display_name":null,"funder_award_id":"NRF-2016R1A2B4009793","funder_id":"https://openalex.org/F4320322030","funder_display_name":"Ministry of Science, ICT and Future Planning"},{"id":"https://openalex.org/G6517691698","display_name":null,"funder_award_id":"NRF-2016R1A2B4009793","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G6686156393","display_name":null,"funder_award_id":"Korean government (MSIP)","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G7933130775","display_name":null,"funder_award_id":"NRF-2016R1A","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G982292920","display_name":null,"funder_award_id":"NRF-20","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"}],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320322030","display_name":"Ministry of Science, ICT and Future Planning","ror":"https://ror.org/032e49973"},{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2565025040.pdf","grobid_xml":"https://content.openalex.org/works/W2565025040.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W96373761","https://openalex.org/W1526692684","https://openalex.org/W1608524621","https://openalex.org/W1972547541","https://openalex.org/W1974657741","https://openalex.org/W2001845525","https://openalex.org/W2003577090","https://openalex.org/W2006072109","https://openalex.org/W2037100250","https://openalex.org/W2046262276","https://openalex.org/W2063840380","https://openalex.org/W2085914298","https://openalex.org/W2100129294","https://openalex.org/W2101802941","https://openalex.org/W2116135393","https://openalex.org/W2123011740","https://openalex.org/W2127038054","https://openalex.org/W2129765035","https://openalex.org/W2135896357","https://openalex.org/W2139540256","https://openalex.org/W2142410337","https://openalex.org/W2145344816","https://openalex.org/W2145626504","https://openalex.org/W2147817641","https://openalex.org/W2186209207","https://openalex.org/W2294514283","https://openalex.org/W4244343699","https://openalex.org/W4251684745","https://openalex.org/W4254260091","https://openalex.org/W6675045236","https://openalex.org/W6675386717","https://openalex.org/W6678978206","https://openalex.org/W6686995523"],"related_works":["https://openalex.org/W2182477562","https://openalex.org/W1595303882","https://openalex.org/W1558159560","https://openalex.org/W4246757943","https://openalex.org/W2375128115","https://openalex.org/W2011582495","https://openalex.org/W2351157934","https://openalex.org/W2245581955","https://openalex.org/W2795392346","https://openalex.org/W2143679819"],"abstract_inverted_index":{"A":[0],"reverse":[1,32,46],"k":[2,19,33],"nearest":[3,34,47],"neighbor":[4,35,48],"(RkNN)":[5],"query":[6,53,135,177,183],"retrieves":[7],"all":[8],"the":[9,42,52,67,91,101,107,129,147,166,169,173,176,182,205,216],"data":[10,57,70,137,185],"points":[11,132,164],"that":[12,204],"have":[13],"q":[14,55],"as":[15],"one":[16],"of":[17,44,69,93,133,143,161,168,195],"their":[18,189],"closest":[20],"points.":[21],"In":[22,37,110],"recent":[23],"years,":[24],"considerable":[25],"research":[26],"has":[27,87],"been":[28,88],"conducted":[29,198],"into":[30],"monitoring":[31,92],"queries.":[36],"this":[38,111],"paper,":[39,112],"we":[40,113],"study":[41],"problem":[43],"continuous":[45],"queries":[49,95],"where":[50,100],"both":[51,134],"object":[54,75,145],"and":[56,136,154,184,211],"objects":[58,186],"are":[59,64],"moving.":[60],"Existing":[61],"state-of-the-art":[62,217],"techniques":[63],"sensitive":[65],"towards":[66],"movement":[68],"objects,":[71],"e.g.,":[72],"a":[73,119,159],"candidate":[74],"must":[76],"be":[77],"verified":[78],"whenever":[79],"it":[80],"changes":[81,104],"its":[82,151],"location.":[83],"Further,":[84],"insufficient":[85],"attention":[86],"given":[89],"to":[90,215],"RNN":[94],"in":[96],"dynamic":[97],"road":[98,201],"networks":[99],"network":[102],"weight":[103],"depending":[105],"on":[106],"traffic":[108],"conditions.":[109],"address":[114],"these":[115],"problems":[116],"by":[117],"proposing":[118],"new":[120],"safe":[121,130,140,152,162,170,174,191],"exit-based":[122],"algorithm":[123,207],"called":[124],"CORE-X":[125],"for":[126],"efficiently":[127],"computing":[128],"exit":[131,141,163],"objects.":[138],"The":[139,193],"point":[142,148],"an":[144],"indicates":[146],"at":[149],"which":[150],"region":[153,156],"non-safe":[155],"meet,":[157],"thus":[158],"set":[160],"represents":[165],"border":[167],"region.":[171],"Within":[172],"region,":[175],"result":[178],"remains":[179],"unchanged":[180],"provided":[181],"remain":[187],"inside":[188],"respective":[190],"regions.":[192],"results":[194],"extensive":[196],"experiments":[197],"using":[199],"real":[200],"maps":[202],"indicate":[203],"proposed":[206],"significantly":[208],"reduces":[209],"communication":[210],"computation":[212],"costs":[213],"compared":[214],"algorithm.":[218]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2017-01-06T00:00:00"}
