Skip to main content
Springer Nature Link
Log in

Efficiently processing snapshot and continuous reverse k nearest neighbors queries

  • Regular Paper
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

Given a set of objects and a query q, a point p is called the reverse k nearest neighbor (RkNN) of q if q is one of the k closest objects of p. In this paper, we introduce the concept of influence zone that is the area such that every point inside this area is the RkNN of q and every point outside this area is not the RkNN. The influence zone has several applications in location-based services, marketing and decision support systems. It can also be used to efficiently process RkNN queries. First, we present efficient algorithm to compute the influence zone. Then, based on the influence zone, we present efficient algorithms to process RkNN queries that significantly outperform existing best-known techniques for both the snapshot and continuous RkNN queries. We also present a detailed theoretical analysis to analyze the area of the influence zone and IO costs of our RkNN processing algorithms. Our experiments demonstrate the accuracy of our theoretical analysis. This paper is an extended version of our previous work (Cheema et al. in Proceedings of ICDE, pp. 577–588, 2011). We make the following new contributions in this extended version: (1) we conduct a rigorous complexity analysis and show that the complexity of one of our proposed algorithms in Cheema et al. (Proceedings of ICDE, pp. 577–588, 2011) can be reduced from O(m 2) to O( km) where m > k is the number of objects used to compute the influence zone, (2) we show that our techniques can be applied to dimensionality higher than two, and (3) we present efficient techniques to handle data updates.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Achtert, E., Kriegel, H.-P., Kröger, P., Renz, M., Züfle, A.: Reverse k-nearest neighbor search in dynamic and general metric databases. In: Proceedings of EDBT, pp. 886–897 (2009)

  2. Benetis, R., Jensen, C.S., Karciauskas, G., Saltenis, S.: Nearest neighbor and reverse nearest neighbor queries for moving objects. In: Proceedings of IDEAS (2002)

  3. Bernecker, T., Emrich, T., Kriegel, H.-P., Mamoulis, N., Renz, M., Züfle, A.: A novel probabilistic pruning approach to speed up similarity queries in uncertain databases. In: Proceedings of ICDE, pp. 339–350 (2011)

  4. Bernecker, T., Emrich, T., Kriegel, H.-P., Renz, M., Züfle, S.Z.A.: Efficient probabilistic reverse nearest neighbor query processing on uncertain data. In: Proceedings of PVLDB (2011)

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

    Article  MATH  Google Scholar 

  6. Cheema, M.A., Brankovic, L., Lin, X., Zhang, W., Wang, W.: Multi-guarded safe zone: an effective technique to monitor moving circular range queries. In: Proceedings of ICDE (2010)

  7. Cheema M.A., Brankovic L., Lin X., Zhang W., Wang W.: Continuous monitoring of distance-based range queries. IEEE TKDE 23(8), 1182–1199 (2011)

    Google Scholar 

  8. Cheema M.A., Lin X., Wang W., Zhang W., Pei J.: Probabilistic reverse nearest neighbor queries on uncertain data. IEEE Trans. Knowl. Data Eng. 22(4), 550–564 (2010)

    Article  Google Scholar 

  9. Cheema, M.A., Lin, X., Zhang, W., Zhang, Y.: Influence zone: efficiently processing reverse k nearest neighbors queries. In: Proceedings of ICDE, pp. 577–588 (2011)

  10. Cheema M.A., Lin X., Zhang Y., Wang W., Zhang W.: Lazy updates: an efficient technique to continuously monitoring reverse knn. PVLDB 2(1), 1138–1149 (2009)

    Google Scholar 

  11. Cheema M.A., Zhang W., Lin X., Zhang Y., Li X.: Continuous reverse k nearest neighbors queries in euclidean space and in spatial networks. VLDB J. 21(1), 69–95 (2012)

    Article  Google Scholar 

  12. Emrich, T., Kriegel, H.-P., Kröger, P., Renz, M., Xu, N., Züfle, A.: Reverse k-nearest neighbor monitoring on mobile objects. In: Proceedings of GIS, pp. 494–497 (2010)

  13. Emrich, T., Kriegel, H.-P., Kröger, P., Renz, M., Züfle, A.: Boosting spatial pruning: on optimal pruning of mbrs. In: Proceedings of SIGMOD Conference, pp. 39–50 (2010)

  14. Gedik, B., Liu, L.: Mobieyes: Distributed processing of continuously moving queries on moving objects in a mobile system. In: Proceedings of EDBT, pp. 67–87 (2004)

  15. Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proceedings of SIGMOD Conference (1984)

  16. Haines E.: Graphics Gems IV, Chapter Point in Polygon Strategies. Academic Press Professional, Cambridge (1994)

    Google Scholar 

  17. Hasan, M., Cheema, M.A., Lin, X., Zhang, W.: A unified algorithm for continuous monitoring of spatial queries. In: Proceedings of DASFAA (2), pp. 104–118 (2011)

  18. Hasan, M., Cheema, M.A., Lin, X., Zhang, Y.: Efficient construction of safe regions for moving knn queries over dynamic datasets. In: Proceedings of SSTD (2009)

  19. Hasan, M., Cheema, M.A., Qu, W., Lin, X.: Efficient algorithms to monitor continuous constrained nearest neighbor queries. In: Proceedings of DASFAA (1), pp. 233–249 (2010)

  20. Icking, C., Klein, R.: Searching for the kernel of a polygon—a competitive strategy. In: Proceedings of SoCG, pp. 258–266 (1995)

  21. Iwerks, G.S., Samet, H., Smith, K.P.: Continuous k-nearest neighbor queries for continuously moving points with updates. In: Proceedings of VLDB, pp. 512–523 (2003)

  22. Kamel, I., Faloutsos, C.: On packing r-trees. In: Proceedings of CIKM (1993)

  23. Kang, J.M., Mokbel, M.F., Shekhar, S., Xia, T., Zhang, D.: Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors. In: Proceedings of ICDE (2007)

  24. Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: Proceedings of SIGMOD (2000)

  25. Lazaridis, I., Porkaew, K., Mehrotra, S.: Dynamic queries over mobile objects. In: Proceedings of EDBT, pp. 269–286 (2002)

  26. Li G., Li Y., Li J., LihChyun S., Yang F.: Continuous reverse k nearest neighbor monitoring on moving objects in road networks. Inf. Syst. 35, 860–883 (2010)

    Article  Google Scholar 

  27. Lian X., Chen L.: Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data. VLDB J. 18(3), 787–808 (2009)

    Article  Google Scholar 

  28. Lin, K.-I., Nolen, M., Yang, C.: Applying bulk insertion techniques for dynamic reverse nearest neighbor problems. In: Proceedings of IDEAS, pp. 290–297 (2003)

  29. Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring. In: Proceedings of SIGMOD (2005)

  30. Okabe, A., Boots, B., Sugihara, K., Chiu, S.N.: Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. Wiley, Chichester (1999)

    Google Scholar 

  31. Preparata F.P., Shamos M.I.: Computational Geometry An Introduction. Springer, Berlin (1985)

    Google Scholar 

  32. Safar M., Ebrahimi D., Taniar D.: Voronoi-based reverse nearest neighbor query processing on spatial networks. Multimedia Syst. 15(5), 295–308 (2009)

    Article  Google Scholar 

  33. Stanoi, I., Agrawal, D., Abbadi, A.E.: Reverse nearest neighbor queries for dynamic databases. In: Proceedings of ACM SIGMOD Workshop (2000)

  34. Stanoi, I., Riedewald, M., Agrawal, D., Abbadi, A.E.: Discovery of influence sets in frequently updated databases. In: Proceedings of VLDB (2001)

  35. Sun, H.-L., Jiang, C., Liu, J.-L., Sun, L.: Continuous reverse nearest neighbor queries on moving objects in road networks. In: Proceedings of WAIM, pp. 238–245 (2008)

  36. Tao, Y., Papadias, D., Lian, X.: Reverse knn search in arbitrary dimensionality. In: Proceedings of VLDB (2004)

  37. Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: Proceedings of VLDB, pp. 287–298 (2002)

  38. Theodoridis Y., Stefanakis E., Sellis T.K.: Efficient cost models for spatial queries using R-trees. IEEE TKDE 12(1), 19–32 (2000)

    Google Scholar 

  39. Tran Q.T., Taniar D., Safar M.: Reverse k nearest neighbor and reverse farthest neighbor search on spatial networks. Trans. Large-Scale Data Knowl. Cent. Syst. 1, 353–372 (2009)

    Article  Google Scholar 

  40. Wu, W., Yang, F., Chan, C.Y., Tan, K.-L.: Continuous reverse k-nearest-neighbor monitoring. In: Proceedings of MDM (2008)

  41. Wu, W., Yang, F., Chan, C.Y., Tan, K.-L.: Finch: Evaluating reverse k-nearest-neighbor queries on location data. In: Proceedings of VLDB (2008)

  42. Xia, T., Zhang, D.: Continuous reverse nearest neighbor monitoring. In: Proceedings of ICDE, p. 77 (2006)

  43. Xing, Z., Pei, J., Yu, P.S.: Early prediction on time series: a nearest neighbor approach. In: Proceedings of IJCAI (2009)

  44. Xiong, X., Mokbel, M.F., Aref, W.G.: Sea-cnn: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In: Proceedings of ICDE, pp. 643–654 (2005)

  45. Yang, C., Lin, K.-I.: An index structure for efficient reverse nearest neighbor queries. In: Proceedings of ICDE (2001)

  46. Yiu, M.L., Mamoulis, N., Karras, P.: Common influence join: a natural join operation for spatial pointsets. In: Proceedings of ICDE (2008)

  47. Yiu, M.L., Papadias, D., Mamoulis, N., Tao, Y.: Reverse nearest neighbors in large graphs. IEEE TKDE 18(4), 540–553 (2006)

    Google Scholar 

  48. Yu, X., Pu, K.Q., Koudas, N.: Monitoring k-nearest neighbor queries over moving objects. In: Proceedings of ICDE (2005)

  49. Zhang, J., Zhu, M., Papadias, D., Tao, Y., Lee, D.L.: Location-based spatial queries. In: Proceedings of SIGMOD (2003)

Download references

Author information

Authors and Affiliations

  1. Software College, East China Normal University, Putuo, Shanghai, China

    Xuemin Lin

  2. School of Computer Science and Engineering, The University of New South Wales, Kensington, NSW, Australia

    Muhammad Aamir Cheema, Wenjie Zhang, Xuemin Lin & Ying Zhang

Authors
  1. Muhammad Aamir Cheema
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wenjie Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xuemin Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ying Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xuemin Lin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cheema, M.A., Zhang, W., Lin, X. et al. Efficiently processing snapshot and continuous reverse k nearest neighbors queries. The VLDB Journal 21, 703–728 (2012). https://doi.org/10.1007/s00778-012-0265-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-012-0265-y

Keywords