Skip to main content

Privacy Preserving Reverse Nearest-Neighbor Queries Processing on Road Network

  • Conference paper
Web-Age Information Management (WAIM 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7419))

Included in the following conference series:

Abstract

In recent years, with the popularity of Location Based Service (LBS) and recommendation system, spatial data query has become a hot study area. Reverse nearest neighbor (RNN) query is one of the most important queries in spatial database. It plays an important role in decision-making system, recommended system and frameworks like so on. In many cases, users do not want to disclose the specific location information to the system. It requires a certain extent anonymous of user information. Compared to the common Euclidean space, Road Network is more practical. However, in previous studies, there is no RNN queries base on road network taking into account the protection of user privacy. In this paper, we propose a novel algorithm- RN-BRNN(Road Network - Bichromatic Reverse Nearest Neighbor) query algorithm, which considering both the road network bichromatic RNN query and user location privacy protection. RN-BRNN algorithm establishes a special Voronoi Cell based on the road network, queried points anonymity, and probability calculus of obtained RNN. Extensive experimental results show that the algorithm maintenances the same time-complexity with the Euclidean space, and improved precision greatly.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ioana, S., Divyakant, A., Amr, E.A.: Reverse Nearest Neighbors Queries for Dynamic Datasets. In: SIGMOD Workshop DMKD, pp. 44–53 (2000)

    Google Scholar 

  2. Ting, W., Ling, L.: Privacy-Aware Mobile Services over Road Networks. In: VLDB, Lyon, France, pp. 1042–1051 (2009)

    Google Scholar 

  3. Mehdi, S., Cyrus, S.: VoR-Tree: R-trees with Voronoi Diagrams for Effecient Processing of Spatial Nearest Neighbor Queries. In: VLDB, vol. 3(1), pp. 1231–1242, Singapore (2010)

    Google Scholar 

  4. Mehdi, S., Cyrus, S.: Approximate Voronoi Cell Computation on Spatial Data Streams. In: VLDB, vol. 18, pp. 57–79 (2009)

    Google Scholar 

  5. Kefeng, X., Geng, Z., David, T., Wenny, R., Maytham, S., Bala, S.: Voronoi-based Range and Continuous Range Query Processing in Mobile Databases. Journal of Computer and System Sciences, 637–651 (2011)

    Google Scholar 

  6. Cheng, R., Xie, X., Yiu, M.L., Chen, J., Sun, L.: UV-Diagram: A Voronoi Diagram for Uncertain Data. In: ICDE, pp. 796–807 (2010)

    Google Scholar 

  7. Lingchen, Z., Xin, L., Junzhong, G., Peng, C.: Bichromatic Reverse Nearest-Neighbors Queries based on Uncertain Dataset. In: International Conference on Future Information Technology, vol. 1, pp. 294–298 (2010)

    Google Scholar 

  8. Thomas, B., Tobias, E., Hans-Peter, K., Nikos, M., Matthias, R., Andreas, Z.: A Novel Probabilistic Pruning Approach to Speed up Similarity Queries in Uncertain Databases. In: ICDE, pp. 339–350 (2011)

    Google Scholar 

  9. Dimitris, P., Jun, Z., Nikos, M., Yufei, T.: Query Processing in Spatial Network Databases. In: VLDB, vol. 29, pp. 802–813 (2003)

    Google Scholar 

  10. David, T., Maytham, S., Quoc, T.T., Wenny, R., Jong, H.P.: Spatial Network RNN Queries in GIS. The Computer Journal, 617–627 (2011)

    Google Scholar 

  11. R-Tree Index Structure, http://libspatialindex.github.com/

  12. Dataset, http://www.cs.fsu.edu/~lifeifei/SpatialDataset.htm

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, X., Zhou, L., Chen, P., Gu, J. (2012). Privacy Preserving Reverse Nearest-Neighbor Queries Processing on Road Network. In: Bao, Z., et al. Web-Age Information Management. WAIM 2012. Lecture Notes in Computer Science, vol 7419. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33050-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33050-6_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33049-0

  • Online ISBN: 978-3-642-33050-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics