{"id":"https://openalex.org/W3170153589","doi":"https://doi.org/10.1007/s11227-022-04496-2","title":"Efficient exact k-flexible aggregate nearest neighbor search in road networks using the M-tree","display_name":"Efficient exact k-flexible aggregate nearest neighbor search in road networks using the M-tree","publication_year":2022,"publication_date":"2022-05-04","ids":{"openalex":"https://openalex.org/W3170153589","doi":"https://doi.org/10.1007/s11227-022-04496-2","mag":"3170153589"},"language":"en","primary_location":{"id":"doi:10.1007/s11227-022-04496-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11227-022-04496-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11227-022-04496-2.pdf","source":{"id":"https://openalex.org/S32326811","display_name":"The Journal of Supercomputing","issn_l":"0920-8542","issn":["0920-8542","1573-0484"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Journal of Supercomputing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s11227-022-04496-2.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062211029","display_name":"Moonyoung Chung","orcid":null},"institutions":[{"id":"https://openalex.org/I142401562","display_name":"Electronics and Telecommunications Research Institute","ror":"https://ror.org/03ysstz10","country_code":"KR","type":"facility","lineage":["https://openalex.org/I142401562","https://openalex.org/I2801339556","https://openalex.org/I4210144908","https://openalex.org/I4387152098"]},{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Moonyoung Chung","raw_affiliation_strings":["Artificial Intelligence Research Laboratory, Electronics and Telecommunications Research Institute (ETRI), Daejeon, 34129, Republic of Korea","School of Computing, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, 34141, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Artificial Intelligence Research Laboratory, Electronics and Telecommunications Research Institute (ETRI), Daejeon, 34129, Republic of Korea","institution_ids":["https://openalex.org/I142401562"]},{"raw_affiliation_string":"School of Computing, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, 34141, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109870434","display_name":"Soon J. Hyun","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Soon J. Hyun","raw_affiliation_strings":["School of Computing, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, 34141, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, Korea Advanced Institute of Science and Technology (KAIST), Daejeon, 34141, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086490576","display_name":"Woong-Kee Loh","orcid":"https://orcid.org/0000-0002-3161-6479"},"institutions":[{"id":"https://openalex.org/I12832649","display_name":"Gachon University","ror":"https://ror.org/03ryywt80","country_code":"KR","type":"education","lineage":["https://openalex.org/I12832649"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Woong-Kee Loh","raw_affiliation_strings":["School of Computing, Gachon University, Songnam, 13120, Republic of Korea"],"raw_orcid":"https://orcid.org/0000-0002-3161-6479","affiliations":[{"raw_affiliation_string":"School of Computing, Gachon University, Songnam, 13120, Republic of Korea","institution_ids":["https://openalex.org/I12832649"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5086490576"],"corresponding_institution_ids":["https://openalex.org/I12832649"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.7429,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.66583229,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":"78","issue":"14","first_page":"16286","last_page":"16302"},"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.9991000294685364,"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.9765999913215637,"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.7609689235687256},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5964202880859375},{"id":"https://openalex.org/keywords/aggregate","display_name":"Aggregate (composite)","score":0.5936410427093506},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5878902077674866},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5734542608261108},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5457770228385925},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5305184721946716},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5182176232337952},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4886923134326935},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.45224013924598694},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.44724786281585693},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27018263936042786},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25320637226104736},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20745640993118286},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18792489171028137}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7609689235687256},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5964202880859375},{"id":"https://openalex.org/C4679612","wikidata":"https://www.wikidata.org/wiki/Q866298","display_name":"Aggregate (composite)","level":2,"score":0.5936410427093506},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5878902077674866},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5734542608261108},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5457770228385925},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5305184721946716},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5182176232337952},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4886923134326935},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.45224013924598694},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.44724786281585693},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27018263936042786},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25320637226104736},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20745640993118286},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18792489171028137},{"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/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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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.1007/s11227-022-04496-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11227-022-04496-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11227-022-04496-2.pdf","source":{"id":"https://openalex.org/S32326811","display_name":"The Journal of Supercomputing","issn_l":"0920-8542","issn":["0920-8542","1573-0484"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Journal of Supercomputing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s11227-022-04496-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11227-022-04496-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11227-022-04496-2.pdf","source":{"id":"https://openalex.org/S32326811","display_name":"The Journal of Supercomputing","issn_l":"0920-8542","issn":["0920-8542","1573-0484"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Journal of Supercomputing","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.7099999785423279,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G3953818065","display_name":null,"funder_award_id":"2021R1A2C101443","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G4573211964","display_name":null,"funder_award_id":"2021R1A2C1014432","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G4755966404","display_name":null,"funder_award_id":"2020-0-00073","funder_id":"https://openalex.org/F4320335489","funder_display_name":"Institute for Information and Communications Technology Promotion"}],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"},{"id":"https://openalex.org/F4320328359","display_name":"Ministry of Science and ICT, South Korea","ror":"https://ror.org/01wpjm123"},{"id":"https://openalex.org/F4320335489","display_name":"Institute for Information and Communications Technology Promotion","ror":"https://ror.org/01g0hqq23"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3170153589.pdf","grobid_xml":"https://content.openalex.org/works/W3170153589.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W328847996","https://openalex.org/W1633222579","https://openalex.org/W1970696407","https://openalex.org/W1981634604","https://openalex.org/W1985933986","https://openalex.org/W1990017533","https://openalex.org/W2000480596","https://openalex.org/W2112513979","https://openalex.org/W2130189692","https://openalex.org/W2143709779","https://openalex.org/W2147713365","https://openalex.org/W2157092487","https://openalex.org/W2160080073","https://openalex.org/W2169336598","https://openalex.org/W2193780041","https://openalex.org/W2229332794","https://openalex.org/W2257437291","https://openalex.org/W2267977268","https://openalex.org/W2795286139","https://openalex.org/W2799302953","https://openalex.org/W2938803780","https://openalex.org/W2954026369","https://openalex.org/W2980994080","https://openalex.org/W3008342002","https://openalex.org/W3032358677","https://openalex.org/W3038757108","https://openalex.org/W3044968736","https://openalex.org/W3108366954","https://openalex.org/W3130141754","https://openalex.org/W3154086854","https://openalex.org/W3184108223","https://openalex.org/W3187714972","https://openalex.org/W4200211261"],"related_works":["https://openalex.org/W2375128115","https://openalex.org/W2182477562","https://openalex.org/W2245581955","https://openalex.org/W2351157934","https://openalex.org/W2381195555","https://openalex.org/W2519241726","https://openalex.org/W2990663423","https://openalex.org/W1558159560","https://openalex.org/W2097149198","https://openalex.org/W2978680959"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"study":[2,81],"proposes":[3],"an":[4],"efficient":[5],"exact":[6,119],"k":[7,13,26,49,93,154],"-flexible":[8],"aggregate":[9],"nearest":[10],"neighbor":[11],"(":[12],"-FANN)":[14],"search":[15],"algorithm":[16,28,77,115,121,130,150],"in":[17,44,79],"road":[18,45,146],"networks":[19],"using":[20,143],"the":[21,30,39,59,68,96,102,109,117,124],"M-tree.":[22,125],"The":[23],"state-of-the-art":[24],"IER-":[25,48,92,153],"NN":[27,50,94,155],"used":[29],"R-tree":[31],"and":[32],"pruned":[33],"off":[34],"unnecessary":[35,53,85],"nodes":[36,57,89],"based":[37,100],"on":[38,101],"Euclidean":[40,60],"coordinates":[41],"of":[42,111,141],"objects":[43,63],"networks.":[46],"However,":[47],"made":[51],"many":[52],"accesses":[54,86],"to":[55,87,158],"index":[56,88],"since":[58,95],"distances":[61,71,105],"between":[62,72,106],"are":[64],"significantly":[65],"different":[66],"from":[67],"actual":[69,103],"shortest-path":[70,104],"them.":[73],"In":[74,137],"contrast,":[75],"our":[76,112,114,129,149],"proposed":[78],"this":[80],"can":[82],"greatly":[83],"reduce":[84],"compared":[90],"with":[91],"M-tree":[97],"is":[98,116],"constructed":[99],"objects.":[107],"To":[108],"best":[110],"knowledge,":[113],"first":[118],"FANN":[120],"that":[122,128],"uses":[123],"We":[126],"prove":[127],"does":[131],"not":[132],"cause":[133],"any":[134],"false":[135],"drop.":[136],"conducting":[138],"a":[139],"series":[140],"experiments":[142],"various":[144],"real":[145],"network":[147],"datasets,":[148],"consistently":[151],"outperformed":[152],"by":[156],"up":[157],"6.92":[159],"times.":[160]},"counts_by_year":[{"year":2023,"cited_by_count":5}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}