Efficient shortest path finding of k-nearest neighbor objects in road network databases
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shin, Sung-Hyun | - |
dc.contributor.author | Lee, Sang-Chul | - |
dc.contributor.author | Kim, Sang-Wook | - |
dc.contributor.author | Lee, Junghoon | - |
dc.contributor.author | Im, Eul Gyu | - |
dc.date.accessioned | 2022-12-20T18:39:39Z | - |
dc.date.available | 2022-12-20T18:39:39Z | - |
dc.date.created | 2022-09-16 | - |
dc.date.issued | 2010-03 | - |
dc.identifier.issn | 0000-0000 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/175289 | - |
dc.description.abstract | This paper addresses an efficient path finding scheme that complements classic k-NN (Nearest Neighbor) queries for the road network. Aiming at finding both k objects and the shortest paths to them at the same time, this paper first selects candidate objects by the k-NN search scheme based on the underlying index structure and then finds the path to each of them by the modified A* algorithm. The path finding step stores the intermediary paths from the query point to all of the scanned nodes and then attempts to match the common segment with a path to a new node, instead of repeatedly running the A* algorithm for all k points. Additionally, the cost to the each object calculated in this step makes it possible to finalize the k objects from the candidate set as well as to order them by the path cost. Judging from the result, the proposed scheme can eliminate redundant node scans and provide one of the most fundamental building blocks for location-based services in the real-life road network. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ACM | - |
dc.title | Efficient shortest path finding of k-nearest neighbor objects in road network databases | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Sang-Wook | - |
dc.identifier.doi | 10.1145/1774088.1774446 | - |
dc.identifier.scopusid | 2-s2.0-77954702560 | - |
dc.identifier.bibliographicCitation | Proceedings of the ACM Symposium on Applied Computing, pp.1661 - 1665 | - |
dc.relation.isPartOf | Proceedings of the ACM Symposium on Applied Computing | - |
dc.citation.title | Proceedings of the ACM Symposium on Applied Computing | - |
dc.citation.startPage | 1661 | - |
dc.citation.endPage | 1665 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Efficient path | - |
dc.subject.keywordPlus | Fundamental building blocks | - |
dc.subject.keywordPlus | Index structure | - |
dc.subject.keywordPlus | K points | - |
dc.subject.keywordPlus | K-nearest neighbors | - |
dc.subject.keywordPlus | K-nearest-neighbor queries | - |
dc.subject.keywordPlus | k-NN search | - |
dc.subject.keywordPlus | Location-Based Services | - |
dc.subject.keywordPlus | Nearest neighbors | - |
dc.subject.keywordPlus | Path finding | - |
dc.subject.keywordPlus | Query points | - |
dc.subject.keywordPlus | Redundant nodes | - |
dc.subject.keywordPlus | Road network | - |
dc.subject.keywordPlus | Shortest path | - |
dc.subject.keywordPlus | Fuzzy control | - |
dc.subject.keywordPlus | Graph theory | - |
dc.subject.keywordPlus | Roads and streets | - |
dc.subject.keywordPlus | Wireless sensor networks | - |
dc.subject.keywordPlus | Motor transportation | - |
dc.subject.keywordAuthor | k-nearest neighbor query | - |
dc.subject.keywordAuthor | road network | - |
dc.subject.keywordAuthor | shortest path | - |
dc.identifier.url | https://dl.acm.org/doi/10.1145/1774088.1774446 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
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.