Skip to main content
Springer Nature Link
Log in

A safe region based approach to moving KNN queries in obstructed space

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

The moving \(k\) nearest neighbor (MkNN) query has been studied extensively. Most of the studies assume no obstacle in the space. However, obstacles like rivers, buildings and private properties commonly exist in the space, and one may need to go around the obstacles to reach his/her nearest neighbors. In this paper, we study the moving kNN query in obstructed space with no predefined query object trajectory. We take a safe region based approach to solve this problem. In particular, we propose a method to compute a safe region w.r.t. a data object. In this safe region, the query object can move freely, while the data object is kept in the query object’s kNN set. By combining the safe regions of the data objects near the query object, we formulate an overall safe region where the query object’s kNN set keeps stable. We propose an algorithm based on the safe regions to process the moving kNN query in obstructed space. Extensive experiments show that the proposed algorithm significantly reduces the communication and the computation costs for query processing. Our algorithm outperforms a baseline algorithm by up to two orders of magnitude under various settings.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23

Similar content being viewed by others

Notes

  1. http://www.chorochronos.org/.

References

  1. Beckmann N, Kriegel H, Schneider R, Seeger B (1990) The r*-tree: an efficient and robust access method for points and rectangles. SIGMOD Record 19(2):322–331

    Article  Google Scholar 

  2. Benetis R, Jensen S, Karčiauskas G, čaltenis S (2006) Nearest and reverse nearest neighbor queries for moving objects. VLDB J 15(3):229–249

    Article  Google Scholar 

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

    Google Scholar 

  4. Chew LP (1989) Constrained delaunay triangulations. Algorithmica 4(1–4):97–108

    Article  MATH  MathSciNet  Google Scholar 

  5. De Berg M, Gudmundsson J, Hammar M, Overmars M (2003) On r-trees with low query complexity. Comput Geom 24(3):179–195

    Article  MATH  MathSciNet  Google Scholar 

  6. De Berg M, Cheong O, Van Kreveld M, Overmars M (2008) Computational geometry: algorithms and applications. Springer, Berlin

    Book  Google Scholar 

  7. Dijkstra E (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1(1):269–271

  8. Eunus Ali M, Zhang R, Tanin E, Kulik L (2008) A motion-aware approach to continuous retrieval of 3d objects. In: ICDE, pp 843–852

  9. Gao Y, Zheng B (2009) Continuous obstructed nearest neighbor queries in spatial databases. In: SIGMOD, pp 577–590

  10. Gao Y, Yang J, Chen G, Zheng B, Chen C (2011) On efficient obstructed reverse nearest neighbor query processing. In: ACM SIGSPATIAL, pp 191–200

  11. Gao Y, Zheng B, Chen G, Li Q, Guo X (2011) Continuous visible nearest neighbor query processing in spatial databases. VLDB J 20(3):371–396

  12. Hsueh YL, Zimmermann R, Wang H, Ku WS (2007) Partition-based lazy updates for continuous queries over moving objects. In: GIS, pp 1–8

  13. Hu H, Xu J, Lee DL (2005) A generic framework for monitoring continuous spatial queries over moving objects. In: SIGMOD, pp 479–490

  14. Jagadish HV, Ooi BC, Tan K, Yu C, Zhang R (2005) idistance: an adaptive b\({}^{{+}}\)-tree based indexing method for nearest neighbor search. ACM Trans Database Syst 30(2):364–397

    Article  Google Scholar 

  15. Kolahdouzan M, Shahabi C (2004) Voronoi-based k nearest neighbor search for spatial network databases. In: Very Large Data Bases, pp 840–851

  16. Li C, Gu Y, Li F, Chen M (2010) Moving k-nearest neighbor query over obstructed regions. In: Asia-Pacific Web Conference, pp 29–35

  17. Li C, Gu Y, Yu G, Li F (2011) wneighbors: a method for finding k nearest neighbors in weighted regions. In: DASFAA, Springer, pp 134–148

  18. Li C, Gu Y, Qi J, Yu G, Zhang R, Yi W (2014) Processing moving knn queries using influential neighbor sets. Proc VLDB Endow 8(2):113–124

    Article  Google Scholar 

  19. Mokbel MF, Aref WG (2008) Sole: scalable on-line execution of continuous queries on spatio-temporal data streams. VLDB J 17(5):971–995

    Article  Google Scholar 

  20. Mokbel MF, Xiong X, Aref WG (2004) Sina: scalable incremental processing of continuous queries in spatio-temporal databases. In: SIGMOD, pp 623–634

  21. Mouratidis K, Papadias D, Bakiras S, Tao Y (2005) A threshold-based algorithm for continuous monitoring of k nearest neighbors. TKDE 17:1451–1464

    Google Scholar 

  22. Nutanong S, Zhang R, Tanin E, Kulik L (2008) The v*diagram: a query dependent approach to moving knn queries. In: Very Large Data Bases, pp 1095–1106

  23. Okabe A, Boots B, Sugihara K, Chiu SN (2000) Spatial tessellations. Wiley, NY

    Book  MATH  Google Scholar 

  24. Preparata F, Shamos M (1985) Computational geometry: an introduction. Springer, Berlin

    Book  Google Scholar 

  25. Song Z, Roussopoulos N (2001) K-nearest neighbor search for moving query point. In: SSTD, pp 79–96

  26. Tao Y, Papadias D (2002) Time-parameterized queries in spatio-temporal databases. In: SIGMOD, pp 334–345

  27. Tao Y, Papadias D, Shen Q (2002) Continuous nearest neighbor search. In: Very Large Data Bases, pp 287–298

  28. Šaltenis S, Jensen CS, Leutenegger ST, Lopez MA (2000) Indexing the positions of continuously moving objects. In: SIGMOD, pp 331–342

  29. Wang Y, Zhang R, Xu C, Qi J, Gu Y, Yu G (2014) Continuous visible k nearest neighbor query on moving objects. Inf Syst 44:1–21

    Article  MATH  Google Scholar 

  30. Ward PG, He Z, Zhang R, Qi J (2014) Real-time continuous intersection joins over large sets of moving objects using graphic processing units. The VLDB J, 1–21

  31. Xia C, Hsu D, Tung AK (2004) A fast filter for obstructed nearest neighbor queries. In: Williams H, MacKinnon L (eds) Key Technologies for Data Management, Springer, pp 203–215

  32. Xia T, Zhang D (2006) Continuous reverse nearest neighbor monitoring. In: ICDE, pp 77–86

  33. Xiong X, Mokbel MF, Aref WG (2005) Sea-cnn: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In: ICDE, pp 643–654

  34. Yu X, Pu KQ, Koudas N (2005) Monitoring k-nearest neighbor queries over moving objects. In: ICDE, pp 631–642

  35. Zhang J, Zhu M, Papadias D, Tao Y, Lee DL (2003) Location-based spatial queries. In: SIGMOD, pp 443–454

  36. Zhang J, Papadias D, Mouratidis K, Zhu M (2004) Spatial queries in the presence of obstacles. In: International conference on extending database technology, pp 366–384

  37. Zhang R, Jagadish HV, Dai BT, Ramamohanarao K (2010) Optimized algorithms for predictive range and knn queries on moving objects. Inf Syst 35(8):911–932

    Article  Google Scholar 

  38. Zhang R, Qi J, Lin D, Wang W, Wong RCW (2012) A highly optimized algorithm for continuous intersection join queries over moving objects. VLDB J 21(4):561–586

    Article  Google Scholar 

Download references

Acknowledgments

This work is supported by the National Basic Research Program of China under Grant Nos. 2012CB316201 and 2014CB360509, the National Natural Science Foundation of China under Grant Nos. 61300021, 61472071 and 61472072, Australian Research Council (ARC) Discovery Project DP130104587, Australian Research Council (ARC) Future Fellowships Project FT120100832, the Fundamental Research Funds for the Central Universities of China Nos. N120304003 and N130404010 and China Scholarship Council.

Author information

Authors and Affiliations

  1. The School of Information Science and Engineering, Northeastern University, Shenyang, Liaoning, China

    Chuanwen Li, Yu Gu & Ge Yu

  2. The Department of Computing and Information Systems, University of Melbourne, Melbourne, VIC, 3052, Australia

    Jianzhong Qi & Rui Zhang

Authors
  1. Chuanwen Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Yu Gu
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Jianzhong Qi
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Rui Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Ge Yu
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Yu Gu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, C., Gu, Y., Qi, J. et al. A safe region based approach to moving KNN queries in obstructed space. Knowl Inf Syst 45, 417–451 (2015). https://doi.org/10.1007/s10115-014-0803-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-014-0803-6

Keywords