Approximate indexing in road network databases
- Authors
- Lee, Sang-Chul; Kim, Sang-Wook; Lee, Junghoon; Yoo, Jae Soo
- Issue Date
- Mar-2009
- Publisher
- Association for Computing Machinery
- Keywords
- Approximate indexing; Data structures; K-nearest neighbor queries; Road network databases
- Citation
- Proceedings of the ACM Symposium on Applied Computing, pp.1568 - 1572
- Indexed
- SCOPUS
- Journal Title
- Proceedings of the ACM Symposium on Applied Computing
- Start Page
- 1568
- End Page
- 1572
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/177095
- DOI
- 10.1145/1529282.1529632
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/177095)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.