k-Nearest Neighbor Query Processing Algorithms for a Query Region in Road Networks
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 genera...
Uloženo v:
| Vydáno v: | Journal of computer science and technology Ročník 28; číslo 4; s. 585 - 596 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Boston
Springer US
01.07.2013
Springer Nature B.V Cloud Open R&D Center, Chonbuk National University, Chonju 570-752, Korea Department of Computer Engineering, Chonbuk National University, Chonju 570-752, Korea%Department of Computer Engineering, Chonbuk National University, Chonju 570-752, Korea |
| Témata: | |
| ISSN: | 1000-9000, 1860-4749 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | 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. |
|---|---|
| Bibliografie: | 11-2296/TP 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. Hyeong-Il Kim and Jae-Woo Chang（ 1 Department of Computer Engineering, Chonbuk National University, Chonju 570-752, Korea 2 Cloud Open R＆D Center, Chonbuk National University, Chonju 570-752, Korea E-mail： {melipion, jwchang}@jbnu.ac.kr ） island index, k-nearest neighbor query processing scheme, locatiombased service, road network ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| ISSN: | 1000-9000 1860-4749 |
| DOI: | 10.1007/s11390-013-1359-8 |