Approximate indexing in road network databases
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Sang-Chul | - |
dc.contributor.author | Kim, Sang-Wook | - |
dc.contributor.author | Lee, Junghoon | - |
dc.contributor.author | Yoo, Jae Soo | - |
dc.date.accessioned | 2022-12-20T22:55:41Z | - |
dc.date.available | 2022-12-20T22:55:41Z | - |
dc.date.created | 2022-09-16 | - |
dc.date.issued | 2009-03 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/177095 | - |
dc.description.abstract | In this paper, we address approximate indexing for efficient processing of k-nearest neighbor(k-NN) queries in road network databases. Previous methods suffer from either serious performance degradation in query processing or large storage overhead because they did not employ indexing mechanisms based on their network distances. To overcome these drawbacks, we propose a novel method that builds an index on those objects in a road network by approximating their network distances and processes k-NN queries efficiently by using that index. Also, we verify the superiority of the proposed method via extensive experiments using the real-life road network databases. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Association for Computing Machinery | - |
dc.title | Approximate indexing in road network databases | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Sang-Wook | - |
dc.identifier.doi | 10.1145/1529282.1529632 | - |
dc.identifier.scopusid | 2-s2.0-72949097186 | - |
dc.identifier.bibliographicCitation | Proceedings of the ACM Symposium on Applied Computing, pp.1568 - 1572 | - |
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 | 1568 | - |
dc.citation.endPage | 1572 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Indexing mechanisms | - |
dc.subject.keywordPlus | K-nearest neighbors | - |
dc.subject.keywordPlus | K-nearest-neighbor queries | - |
dc.subject.keywordPlus | K-NN query | - |
dc.subject.keywordPlus | Network distance | - |
dc.subject.keywordPlus | Novel methods | - |
dc.subject.keywordPlus | Performance degradation | - |
dc.subject.keywordPlus | Road network | - |
dc.subject.keywordPlus | Storage overhead | - |
dc.subject.keywordPlus | Computer science | - |
dc.subject.keywordPlus | Data structures | - |
dc.subject.keywordPlus | Database systems | - |
dc.subject.keywordPlus | Indexing (materials working) | - |
dc.subject.keywordPlus | Indexing (of information) | - |
dc.subject.keywordPlus | Roads and streets | - |
dc.subject.keywordPlus | Motor transportation | - |
dc.subject.keywordAuthor | Approximate indexing | - |
dc.subject.keywordAuthor | Data structures | - |
dc.subject.keywordAuthor | K-nearest neighbor queries | - |
dc.subject.keywordAuthor | Road network databases | - |
dc.identifier.url | https://dl.acm.org/doi/10.1145/1529282.1529632 | - |
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.