{"id":"https://openalex.org/W4283396562","doi":"https://doi.org/10.3390/a15070223","title":"The Efficient Processing of Moving k-Farthest Neighbor Queries in Road Networks","display_name":"The Efficient Processing of Moving k-Farthest Neighbor Queries in Road Networks","publication_year":2022,"publication_date":"2022-06-23","ids":{"openalex":"https://openalex.org/W4283396562","doi":"https://doi.org/10.3390/a15070223"},"language":"en","primary_location":{"id":"doi:10.3390/a15070223","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15070223","pdf_url":"https://www.mdpi.com/1999-4893/15/7/223/pdf?version=1657019596","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"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":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/15/7/223/pdf?version=1657019596","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Hyung-Ju Cho","raw_affiliation_strings":["Department of Software, Kyungpook National University, 2559 Gyeongsang-daero, Sangju-si 37224, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Software, Kyungpook National University, 2559 Gyeongsang-daero, Sangju-si 37224, Korea","institution_ids":["https://openalex.org/I31419693"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103078027"],"corresponding_institution_ids":["https://openalex.org/I31419693"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.2975,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.4901399,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"15","issue":"7","first_page":"223","last_page":"223"},"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.9994999766349792,"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.9922999739646912,"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/computer-science","display_name":"Computer science","score":0.7056489586830139},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.66009920835495},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6347969174385071},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6245623826980591},{"id":"https://openalex.org/keywords/query-expansion","display_name":"Query expansion","score":0.5644658803939819},{"id":"https://openalex.org/keywords/result-set","display_name":"Result set","score":0.5287779569625854},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.46662580966949463},{"id":"https://openalex.org/keywords/sargable","display_name":"Sargable","score":0.4390884041786194},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3958950638771057},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.3393562436103821},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.28978431224823},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.27050697803497314},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.26414036750793457},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17320790886878967}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7056489586830139},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.66009920835495},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6347969174385071},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6245623826980591},{"id":"https://openalex.org/C99016210","wikidata":"https://www.wikidata.org/wiki/Q5488129","display_name":"Query expansion","level":2,"score":0.5644658803939819},{"id":"https://openalex.org/C4969071","wikidata":"https://www.wikidata.org/wiki/Q7316353","display_name":"Result set","level":3,"score":0.5287779569625854},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.46662580966949463},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.4390884041786194},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3958950638771057},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.3393562436103821},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.28978431224823},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.27050697803497314},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.26414036750793457},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17320790886878967},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a15070223","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15070223","pdf_url":"https://www.mdpi.com/1999-4893/15/7/223/pdf?version=1657019596","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"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":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:e085abb898a64705a381810babef5909","is_oa":true,"landing_page_url":"https://doaj.org/article/e085abb898a64705a381810babef5909","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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 15, Iss 7, p 223 (2022)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/15/7/223/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15070223","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":"Algorithms; Volume 15; Issue 7; Pages: 223","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a15070223","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15070223","pdf_url":"https://www.mdpi.com/1999-4893/15/7/223/pdf?version=1657019596","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"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":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6299999952316284,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4283396562.pdf","grobid_xml":"https://content.openalex.org/works/W4283396562.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W140038270","https://openalex.org/W1579583242","https://openalex.org/W1582540839","https://openalex.org/W1970696407","https://openalex.org/W1972547541","https://openalex.org/W2070928147","https://openalex.org/W2103610940","https://openalex.org/W2159615405","https://openalex.org/W2160080073","https://openalex.org/W2190662813","https://openalex.org/W2229332794","https://openalex.org/W2398268477","https://openalex.org/W2405409302","https://openalex.org/W2419865314","https://openalex.org/W2571253401","https://openalex.org/W2615555727","https://openalex.org/W2756077905","https://openalex.org/W2782331958","https://openalex.org/W2912492336","https://openalex.org/W2949065857","https://openalex.org/W2967996808","https://openalex.org/W3011266996","https://openalex.org/W3035278459","https://openalex.org/W3089311845","https://openalex.org/W4211199510","https://openalex.org/W4283396562","https://openalex.org/W6634832201","https://openalex.org/W6674443043","https://openalex.org/W6683042528","https://openalex.org/W6713362089","https://openalex.org/W6732409474"],"related_works":["https://openalex.org/W2096359267","https://openalex.org/W3125756434","https://openalex.org/W2184296057","https://openalex.org/W2026738364","https://openalex.org/W2146885082","https://openalex.org/W2572349046","https://openalex.org/W2392799717","https://openalex.org/W1793997780","https://openalex.org/W185198413","https://openalex.org/W3049728138"],"abstract_inverted_index":{"Given":[0],"a":[1,7,11,41,47,84,170],"set":[2],"of":[3,65,146,166],"facilities":[4,20,38,67,112,126,148],"F":[5],"and":[6,133,164],"query":[8,15,32,43,70,96,101,116,131,151],"point":[9,44,71,102,152],"q,":[10],"k-farthest":[12,29],"neighbor":[13,30],"(kFN)":[14],"returns":[16],"the":[17,27,36,62,69,75,95,100,109,115,119,130,143,150,162],"k":[18,37,111],"farthest":[19,39,86,113],"f1,f1,\u22ef,fk":[21],"from":[22,40,114],"q.":[23],"This":[24],"study":[25,82,156],"considers":[26],"moving":[28,42,85],"(MkFN)":[31],"that":[33],"constantly":[34],"retrieves":[35,124],"q":[45],"in":[46,53,57,98,118],"road":[48,58,76,159],"network.":[49,77],"The":[50],"main":[51],"challenge":[52],"processing":[54],"MkFN":[55],"queries":[56],"networks":[59,160],"is":[60,103],"avoiding":[61,142],"repeated":[63,144],"retrieval":[64,145],"candidate":[66,125,139,147],"as":[68],"arbitrarily":[72],"moves":[73],"along":[74],"To":[78],"this":[79,81],"end,":[80],"proposes":[83],"search":[87],"algorithm":[88],"(MOFA)":[89],"to":[90,169],"compute":[91],"valid":[92,106,120,135],"segments":[93,136],"for":[94,129],"segment":[97,107,132],"which":[99],"located.":[104],"Each":[105],"has":[108],"same":[110],"locations":[117],"segment.":[121],"Therefore,":[122],"MOFA":[123,167],"only":[127],"once":[128],"computes":[134],"using":[137,157],"these":[138],"facilities,":[140],"thereby":[141],"when":[149],"moves.":[153],"An":[154],"empirical":[155],"real-world":[158],"demonstrates":[161],"superiority":[163],"scalability":[165],"compared":[168],"conventional":[171],"solution.":[172]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}