首页 | 官方网站   微博 | 高级检索  
     


k-Nearest Neighbor Query Processing Algorithms for a Query Region in Road Networks
Authors:Hyeong-Il Kim  Jae-Woo Chang
Affiliation:1. Department of Computer Engineering, Chonbuk National University, Chonju 570-752, Korea
2. Department of Computer Engineering, Chonbuk National University, Chonju 570-752, Korea;Cloud Open R&D Center, Chonbuk National University, Chonju 570-752, Korea
Abstract:Recent development of wireless communication technologies and the popularity of smart phones are making location-based services (LBS) popular. However, requesting queries to LBS servers with users’ exact locations may threat the privacy of users. Therefore, there have been many researches on generating a cloaked query region for user privacy protection. Consequently, an efficient query processing algorithm for a query region is required. So, in this paper, we propose k-nearest neighbor query (k-NN) processing algorithms for a query region in road networks. To efficiently retrieve k-NN points of interest (POIs), we make use of the Island index. We also propose a method that generates an adaptive Island index to improve the query processing performance and storage usage. Finally, we show by our performance analysis that our k-NN query processing algorithms outperform the existing k-Range Nearest Neighbor (kRNN) algorithm in terms of network expansion cost and query processing time.
Keywords:island index  k-nearest neighbor query processing scheme  location-based service  road network
本文献已被 CNKI 万方数据 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号