Skip to main content
Log in

Voronoi-based reverse nearest neighbor query processing on spatial networks

  • Regular Paper
  • Published:
Multimedia Systems Aims and scope Submit manuscript

Abstract

The use of Voronoi diagram has traditionally been applied to computational geometry and multimedia problems. In this paper, we will show how Voronoi diagram can be applied to spatial query processing, and in particular to Reverse Nearest Neighbor (RNN) queries. Spatial and geographical query processing, in general, and RNN in particular, are becoming more important, as online maps are now widely available. In this paper, using the concept of Voronoi diagram, we classify RNN into four types depending on whether the query point and the interest objects are the generator points of the Voronoi Polygon or not. Our approach is based on manipulating Network Voronoi Diagram properties and applying a progressive incremental network expansion for finding the polygon inner network distances required to solve RNN queries. Our experimentation results show that our approaches have good response times in answering RNN queries.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aleksy M., Butter T., Schader M.: Architecture for the development of context-sensitive mobile applications. Mobile Inform. Syst. 4(2), 105–117 (2008)

    Google Scholar 

  2. Dijkstra E.W.: A note on two problems inconnection with graphs. Numer. Math. 1(22), 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  3. Doci A., Xhafa F.: WIT: a wireless integrated traffic model. Mobile Inform. Syst. 4(3), 219–235 (2008)

    Google Scholar 

  4. Gadish D.: Introducing the elasticity of spatial data. Int. J. Data Warehous. Min. IGI Global 4(3), 54–70 (2008)

    Google Scholar 

  5. Goh, J.Y., Taniar, D.: Mobile data mining by location dependencies.The 5th International Conference Intelligent Data Engineering and Automated Learning (IDEAL). Lecture Notes in Computer Science, vol. 3177, pp. 225–231. Springer, Heidelberg (2004)

  6. Goh, J.Y., Taniar, D.: Mining frequency pattern from mobile users.The 8th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES), Part III. Lecture Notes in Computer Science, vol. 3215, pp. 795–801. Springer, Heidelberg (2004)

  7. Gulliver S.R., Ghinea G., Patel M., Serif T.: A context-aware tour guide: user implications. Mobile Inform. Syst. 3(2), 71–88 (2007)

    Google Scholar 

  8. Jayaputera J., Taniar D.: Data retrieval for location-dependent queries in a multi-cell wireless environment. Mobile Inform. Syst. 1(2), 91–108 (2005)

    Google Scholar 

  9. Kolahdouzan, M.R., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. The 13th International Conference on Very Large Data Bases (VLDB), pp. 840–851. Morgan Kaufmann, San Francisco (2004)

  10. Korn, F., Sidiropoulos, N., Faloutsos, C., Siegel, E., Protopapas, Z.: Fast nearest neighbor search in medical image databases. The 22nd International Conference on Very Large Data Bases (VLDB), pp. 215–226, Morgan Kaufmann, San Francisco (1996)

  11. Lee D.L., Zhu M., Hu H.: When location-based services meet databases. Mobile Inform. Syst. 1(2), 81–90 (2005)

    Google Scholar 

  12. Liu N.H., Wu Y.H., Chen R.: Efficient knn search in polyphonic music databases using a lower bounding mechanism. J. Multimedia Syst. 10(6), 1432–1882 (2005)

    Google Scholar 

  13. Martinez, A., Martinez, J., Pérez-Rosés, H., Quirós, R.: Image processing using voronoi diagrams. The International Conference on Image Processing. Computer Vision, and Pattern Recognition, IPCV, pp. 485–491 (2007)

  14. Okabe A., Boots B., Sugihara K., Chiu S.N.: Spatial Tessellations, Concepts and Applications of Voronoi Diagrams 2nd edn. Wiley, New York (2000)

    Google Scholar 

  15. Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. The 29th International Conference on Very Large Data Bases (VLDB), pp. 802–813. Morgan Kaufmann, San Francisco (2003)

  16. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. The ACM SIGMOD International Conference on Management of Data (ACM SIGMOD), pp. 71–79. ACM Press, New York (1995)

  17. Safar M.: K nearest neighbor search in navigation systems. Mobile Inform. Syst. 1(3), 207–224 (2005)

    Google Scholar 

  18. Safar M., Ebrahmi D.: eDar algorithm for continuous knn queries based on PINE. Int. J. Inform. Technol. Web Eng. IGI Global 1(4), 1–21 (2006)

    Google Scholar 

  19. Savary L., Gardarin G., Zeitouni K.: GeoCache—a cache for GML geographical data. Int. J. Data Warehous. Min. IGI Global 3(1), 67–88 (2007)

    Google Scholar 

  20. Seidl, T., Kriegel, H.P.: Optimal multi-step k-nearest neighbor search. The ACM SIGMOD International Conference on Management of Data (ACM SIGMOD), pp. 154–165 , ACM Press, New York (1998)

  21. Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. The 28th International Conference on Very Large Data Bases (VLDB), pp. 287–298, Morgan Kaufmann, San Francisco (2002)

  22. Waluyo, A., Srinivasan, B., Taniar, D.: Optimal broadcast channel for data dissemination in mobile database environment. The 5th International Workshop on Advanced Parallel Programming Technologies (APPT). Lecture Notes in Computer Science, vol. 2834, pp. 655–664. Springer, Heidelberg (2003)

  23. Waluyo, A., Srinivasan, B., Taniar, D.: A taxonomy of broadcast indexing schemes for multi channel data dissemination in mobile database. The 18th International Conference on Advanced Information Networking and Applications (AINA), pp. 213–218. IEEE Computer Society, New York (2004)

  24. Waluyo A., Srinivasan B., Taniar D.: Research in mobile database query optimization and processing. Mobile Inform. Syst. 1(4), 225–252 (2005)

    Google Scholar 

  25. Wang, L., Yang, C., Qi, M., Wang, R., Meng, X., Wang, X.: Design of a walkthrough system for virtual museum based on voronoi diagram. The 3rd International Symposium on Voronoi Diagrams ISVD, pp. 258–263. IEEE Computer Society, New York (2006)

  26. Xuan, K., Zhao, G., Taniar, D., Srinivasan, B.: Continuous range search query processing in mobile navigation. The 14th IEEE International Conference on Parallel and Distributed Systems, ICPADS, pp. 361–368. IEEE Computer Society, New York (2008)

  27. Xuan, K., Zhao, G., Taniar, D., Srinivasan, B., Safar, M., Gavrilova, M.: Continuous range search based on network voronoi diagram. Int. J. Grid Utility Comput. (in press) (2009)

  28. Xuan, K., Zhao, G., Taniar, D., Srinivasan, B., Safar, M., Gavrilova, M.: Network voronoi diagram based range search. The 23rd IEEE International Conference on Advanced Information Networking and Applications, AINA (2009)

  29. Yiu, M.L., Papadias, D., Mamoulis, N., Tao, Y.: Reverse nearest neighbors in large graphs. The 21st International Conference on Data Engineering (ICDE), pp. 186–187, IEEE Computer Society, New York (2005)

  30. Zhao G., Xuan K., Taniar D., Srinivasan B.: Incremental k-nearest-neighbor search on road networks. J. Interconnect. Netw. 9(4), 455–470 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maytham Safar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Safar, M., Ibrahimi, D. & Taniar, D. Voronoi-based reverse nearest neighbor query processing on spatial networks. Multimedia Systems 15, 295–308 (2009). https://doi.org/10.1007/s00530-009-0167-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00530-009-0167-z

Keywords

Navigation