Skip to main content
SpringerLink
Log in

k-Nearest Neighbor Query Processing Algorithms for a Query Region in Road Networks

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Warrior J, McHenry E, McGee K. They know where you are. IEEE Spectrum, 2003, 40(7): 20–25.

    Article  Google Scholar 

  2. Voelcker J. Stalked by satellite: An alarming rise in GPS-enabled harassment. IEEE Spectrum, 2006, 43(7): 15–16.

    Article  Google Scholar 

  3. Mokbel M F, Chow C, ArefWG. The new casper: Query processing for location services without compromising privacy. In Proc. the 32nd Int. Conf. Very Large Data Bases, September 2006, pp. 763–774.

  4. Ghinita G, Kalnis P, Skiadopoulos S. MOBIHIDE: A mobilea peer-to-peer system for anonymous location-based queries. In Proc. the 10th Int. Symposium on Advances in Spatial and Temporal Databases, July 2007, pp. 221–238.

  5. Kim H, Shin Y, Chang J. A grid-based cloaking scheme for continuous queries in distributed systems. In Proc. the 11th Int. Computer and Information Technology, August 2011, pp. 75–82.

  6. Lee H, Oh B, Kim H, Chang J. Grid-based cloaking area creation scheme supporting continuous location-based services. In Proc. the 27th ACM Symposium on Applied Computing, March 2012, pp. 537–543.

  7. Ku W, Chen Y, Zimmermann R. Privacy protected spatial query processing for advanced location based services. Wireless Personal Communications, 2009, 51(1): 53–65.

    Article  Google Scholar 

  8. Bao J, Chow C, Mokbel M F, Ku W. Efficient evaluation of k-range nearest neighbor queries in road networks. In Proc. the 11th Int. Conf. Mobile Data Management, May 2010, pp. 115–124.

  9. Huang X, Jensen C S, Šltenis S. The islands approach to nearest neighbor querying in spatial networks. In Proc. the 9th Int. Symposium on Advances in Spatial and Temporal Databases, August 2005, pp. 73–90.

  10. Wang T, Liu L. Privacy-aware mobile services over road networks. PVLDB, 2009, 2(1): 1042–1053.

    Google Scholar 

  11. Kalnis P, Ghinita G, Mouratidis K, Papadias D. Preventing location-based identity inference in anonymous spatial queries. IEEE Transactions on Knowledge and Data Engineering, 2007, 19(12): 1719–1733.

    Article  Google Scholar 

  12. Chow C, Mokbel M F, Naps J, Nath S. Approximate evaluation of range nearest neighbor queries with quality guarantee. In Proc. the 11th Int. Symposium on Advances in Spatial and Temporal Databases, July 2009, pp.283-301.

  13. Xu J, Tang X, Hu H, Du J. Privacy-conscious location-based queries in mobile environments. IEEE Transactions on Parallel and Distributed Systems, 2010, 21(3): 313–326.

    Article  Google Scholar 

  14. Um J, Kim Y, Lee H, Jang M, Chang J. k-nearest neighbor query processing algorithm for cloaking regions towards user privacy protection in location-based services. Journal of Systems Architecture, 2012, 58(9): 354–371.

    Article  Google Scholar 

  15. Brinkhoff T. A framework for generating network-based moving objects. GeoInformatica, 2002, 6(2): 153–180.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Chonbuk National University, Chonju, 570-752, Korea

    Hyeong-Il Kim & Jae-Woo Chang

  2. Cloud Open R&D Center, Chonbuk National University, Chonju, 570-752, Korea

    Jae-Woo Chang

Authors
  1. Hyeong-Il Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jae-Woo Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jae-Woo Chang.

Additional information

This research was supported by the Korea Institute of Science and Technology Information (KISTI).

The preliminary version of the paper was published in the Proceedings of EDB2012.

Electronic Supplementary Material

Below is the link to the electronic supplementary material.

(DOC 37.5 KB)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kim, HI., Chang, JW. k-Nearest Neighbor Query Processing Algorithms for a Query Region in Road Networks. J. Comput. Sci. Technol. 28, 585–596 (2013). https://doi.org/10.1007/s11390-013-1359-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-013-1359-8

Keywords

Search

Navigation