Efficient exact k-flexible aggregate nearest neighbor search in road networks using the M-tree
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chung, Moonyoung | - |
dc.contributor.author | Hyun, Soon J. | - |
dc.contributor.author | Loh, Woong-Kee | - |
dc.date.accessioned | 2022-09-16T02:40:09Z | - |
dc.date.available | 2022-09-16T02:40:09Z | - |
dc.date.created | 2022-05-23 | - |
dc.date.issued | 2022-09 | - |
dc.identifier.issn | 0920-8542 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/85466 | - |
dc.description.abstract | This study proposes an efficient exact k-flexible aggregate nearest neighbor (k-FANN) search algorithm in road networks using the M-tree. The state-of-the-art IER-kNN algorithm used the R-tree and pruned off unnecessary nodes based on the Euclidean coordinates of objects in road networks. However, IER-kNN made many unnecessary accesses to index nodes since the Euclidean distances between objects are significantly different from the actual shortest-path distances between them. In contrast, our algorithm proposed in this study can greatly reduce unnecessary accesses to index nodes compared with IER-kNN since the M-tree is constructed based on the actual shortest-path distances between objects. To the best of our knowledge, our algorithm is the first exact FANN algorithm that uses the M-tree. We prove that our algorithm does not cause any false drop. In conducting a series of experiments using various real road network datasets, our algorithm consistently outperformed IER-kNN by up to 6.92 times. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.relation.isPartOf | JOURNAL OF SUPERCOMPUTING | - |
dc.title | Efficient exact k-flexible aggregate nearest neighbor search in road networks using the M-tree | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.description.journalClass | 1 | - |
dc.identifier.wosid | 000790702000003 | - |
dc.identifier.doi | 10.1007/s11227-022-04496-2 | - |
dc.identifier.bibliographicCitation | JOURNAL OF SUPERCOMPUTING, v.78, no.14, pp.16286 - 16302 | - |
dc.description.isOpenAccess | Y | - |
dc.identifier.scopusid | 2-s2.0-85129638717 | - |
dc.citation.endPage | 16302 | - |
dc.citation.startPage | 16286 | - |
dc.citation.title | JOURNAL OF SUPERCOMPUTING | - |
dc.citation.volume | 78 | - |
dc.citation.number | 14 | - |
dc.contributor.affiliatedAuthor | Loh, Woong-Kee | - |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | Flexible aggregate nearest neighbor | - |
dc.subject.keywordAuthor | Road networks | - |
dc.subject.keywordAuthor | Exact search | - |
dc.subject.keywordAuthor | Incremental Euclidean restriction | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
1342, Seongnam-daero, Sujeong-gu, Seongnam-si, Gyeonggi-do, Republic of Korea(13120)031-750-5114
COPYRIGHT 2020 Gachon University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.