Encyclopedia of GIS

2017 Edition
| Editors: Shashi Shekhar, Hui Xiong, Xun Zhou

Dynamic Nearest Neighbor Queries in Euclidean Space

  • Sarana NutanongEmail author
  • Mohammed Eunus Ali
  • Egemen Tanin
  • Kyriakos Mouratidis
Reference work entry
DOI: https://doi.org/10.1007/978-3-319-17885-1_1558

Definition

Given a query point \(\mathbf{q}\)

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

References

  1. Aurenhammer F (1991) Voronoi diagrams – a survey of a fundamental geometric data structure. ACM Comput Surv 23(3):345–405CrossRefGoogle Scholar
  2. Cheng R, Kalashnikov DV, Prabhakar S (2004) Querying imprecise data in moving object environments. IEEE Trans Knowl Data Eng 16(9):1112–1127CrossRefGoogle Scholar
  3. Chow C, Mokbel MF (2007) Enabling private continuous queries for revealed user locations. In: SSTD, Boston, MA, USA, pp 258–275Google Scholar
  4. Duckham M, Kulik L (2005) A formal model of obfuscation and negotiation for location privacy. In: Pervasive computing, third international conference, PERVASIVE 2005, Munich, 8–13 May 2005, Proceedings, pp 152–170Google Scholar
  5. Gao Y, Zheng B, Chen G, Chen C, Li Q (2011) Continuous nearest-neighbor search in the presence of obstacles. ACM Trans Database Syst 36(2):9CrossRefGoogle Scholar
  6. Gedik B, Liu L (2004) Mobieyes: distributed processing of continuously moving queries on moving objects in a mobile system. In: EDBT, Heraklion, Crete, Greece, pp 67–87Google Scholar
  7. Gruteser M, Grunwald D (2003) Anonymous usage of location-based services through spatial and temporal cloaking. In: Proceedings of the first international conference on mobile systems, applications, and services, MobiSys 2003, San Francisco, 5–8 May 2003Google Scholar
  8. Hu H, Xu J, Lee DL (2005) A generic framework for monitoring continuous spatial queries over moving objects. In: SIGMOD, Baltimore, Maryland, USA, pp 479–490Google Scholar
  9. Iwerks GS, Samet H, Smith KP (2006) Maintenance of k-nn and spatial join queries on continuously moving points. ACM Trans Database Syst 31(2): 485–536CrossRefGoogle Scholar
  10. Li C, Gu Y, Qi J, Yu G, Zhang R, Yi W (2014) Processing moving knn queries using influential neighbor sets. PVLDB 8(2):113–124Google Scholar
  11. Mouratidis K (2009) Continuous monitoring of spatial queries. In: Encyclopedia of database systems. Springer, New York, pp 479–484Google Scholar
  12. Mouratidis K, Hadjieleftheriou M, Papadias D (2005a) Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring. In: SIGMOD, Baltimore, Maryland, USA, pp 634–645Google Scholar
  13. Mouratidis K, Papadias D, Bakiras S, Tao Y (2005b) A threshold-based algorithm for continuous monitoring of k nearest neighbors. IEEE Trans Knowl Data Eng 17(11):1451–1464CrossRefGoogle Scholar
  14. Mouratidis K, Yiu ML, Papadias D, Mamoulis N (2006) Continuous nearest neighbor monitoring in road networks. In: VLDB, Seoul, Korea, pp 43–54Google Scholar
  15. Niedermayer J, Züfle A, Emrich T, Renz M, Mamoulis N, Chen L, Kriegel H (2013) Probabilistic nearest neighbor queries on uncertain moving object trajectories. PVLDB 7(3):205–216Google Scholar
  16. Nutanong S, Zhang R, Tanin E, Kulik L (2010) Analysis and evaluation of v*-knn: an efficient algorithm for moving knn queries. VLDB J 19(3):307–332CrossRefGoogle Scholar
  17. Okabe A, Boots B, Sugihara K (1992) Spatial tessellations: concepts and applications of Voronoi diagrams. Wiley, New YorkzbMATHGoogle Scholar
  18. Saltenis S, Jensen CS (2002) Indexing of moving objects for location-based services. In: ICDE, San Jose, California, USA, pp 463–472Google Scholar
  19. Song Z, Roussopoulos N (2001) K-nearest neighbor search for moving query point. In: SSTD, Redondo Beach, CA, USA, pp 79–96Google Scholar
  20. Tao Y, Papadias D (2002) Time-parameterized queries in spatio-temporal databases. In SIGMOD, Madison, Wisconsin, USA, pp 334–345Google Scholar
  21. Tao Y, Papadias D, Shen Q (2002) Continuous nearest neighbor search. In: VLDB, Hong Kong, China, pp 287–298Google Scholar
  22. Tao Y, Papadias D, Sun J (2003) The tpr*-tree: an optimized spatio-temporal access method for predictive queries. In: VLDB, Berlin, Germany, pp 790–801Google Scholar
  23. Xiong X, Mokbel MF, Aref WG (2005) SEA-CNN: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In: ICDE, Tokyo, Japan, pp 643–654Google Scholar
  24. Yu X, Pu KQ, Koudas N (2005) Monitoring k-nearest neighbor queries over moving objects. In: ICDE, Tokyo, Japan, pp 631–642Google Scholar
  25. Zhang J, Zhu M, Papadias D, Tao Y, Lee DL (2003) Location-based spatial queries. In: SIGMOD, San Diego, California, USA, pp 443–454Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Sarana Nutanong
    • 1
    Email author
  • Mohammed Eunus Ali
    • 2
  • Egemen Tanin
    • 3
  • Kyriakos Mouratidis
    • 4
  1. 1.City University of Hong KongHong KongChina
  2. 2.Department of Computer Science and EngineeringBangladesh University of Engineering and Technology (BUET)DhakaBangladesh
  3. 3.University of MelbourneMelbourneAustralia
  4. 4.Singapore Management UniversitySingaporeSingapore