Advertisement

GeoInformatica

, Volume 14, Issue 2, pp 163–200 | Cite as

Efficient evaluation of continuous spatio-temporal queries on moving objects with uncertain velocity

  • Yuan-Ko Huang
  • Chiang LeeEmail author
Article

Abstract

Continuous Range (CR) query and Continuous K-Nearest Neighbor (CKNN) query are two important types of spatio-temporal queries. Given a time interval [t s , t e ] and a moving query object q, a CR query is to find the moving objects whose Euclidean distances to q are within a user-given distance at each time instant within [t s , t e ]. A CKNN query is to retrieve the K-Nearest Neighbors (KNNs) of this query object q at each time instant within [t s , t e ]. In this paper, we investigate how to process these spatio-temporal queries efficiently under the situation that the velocity of each object is not fixed. This uncertainty on the velocity of object inevitably results in high complexity in processing spatio-temporal queries. We will discuss the complications incurred by this uncertainty and propose two algorithms, namely the Possibility-based possible within objects searching algorithm and the Possibility-based possible KNN searching algorithm, for the CR query and the CKNN query, respectively. A Possibility-based model is designed accordingly to quantify the possibility of each object being the result of a CR query or a CKNN query. Comprehensive experiments are performed to demonstrate the effectiveness and the efficiency of the proposed approaches.

Keywords

Continuous range query Continuous K-nearest neighbor query Spatio-temporal queries Moving objects 

Notes

Acknowledgements

This work was supported by National Science Council of Taiwan (R.O.C.) under Grants NSC96-2221-E-006-260-MY2 and NSC96-2221-E-006-261-MY2.

References

  1. 1.
    Benetis R, Jensen CS, Karciauskas G, Saltenis S (2002) Nearest neighbor and reverse nearest neighbor queries for moving objects. In: Proceedings of the international database engineering and applications symposium, Canada, 17–19 July 2002, pp 44–53Google Scholar
  2. 2.
    Benetis R, Jensen CS, Karciauskas G, Saltenis S (2006) Nearest neighbor and reverse nearest neighbor queries for moving objects. VLDB J 15(3):229–249CrossRefGoogle Scholar
  3. 3.
    Kalashnikov DV, Prabhakar S, Hambrusch S, Aref W (2002) Efficient evaluation of continuous range queries on moving objects. In: Proceedings of the 13th international conference on database and expert systems applications, Aix en Provence, France, 2–6 September 2002, pp 731–740Google Scholar
  4. 4.
    Lee KCK, Leong HV, Zhou J, Si A (2005) An efficient algorithm for predictive continuous nearest neighbor query processing and result maintenance. In: Proceedings of the 6th international conference on mobile data management, Ayia Napa, Cyprus, 2005, pp 178–182Google Scholar
  5. 5.
    Iwerks G, Samet H, Smith K (2003) Continuous k-nearest neighbor queries for continuously moving points with updates. In: Proceedings of the international conference on very large data bases, Berlin, Germany, 9–12 September 2003, pp 512–523Google Scholar
  6. 6.
    Raptopoulou K, Papadopoulos A, Manolopoulos Y (2003) Fast nearest-neighbor query processing in moving-object databases. GeoInformatica 7(2):113–137CrossRefGoogle Scholar
  7. 7.
    Tao Y, Papadias D (2002) Time parameterized queries in spatio-temporal databases. In: Proceedings of the ACM SIGMOD, Madison, Wisconsin, pp 322–333Google Scholar
  8. 8.
    Tao Y, Papadias D, Shen Q (2002) Continuous nearest neighbor search. In: Proceedings of the international conference on very large data bases, Hong Kong, China, 20–23 August 2002, pp 287–298Google Scholar
  9. 9.
    Mouratidis K, Hadjieleftheriou M, Papadias D, (2005) Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring. In Proceedings of the ACM SIGMOD, pp 634–645Google Scholar
  10. 10.
    Mokbel MF, Xiong X, Aref WG (2004) Sina: scalable incremental processing of continuous queries in spatio-temporal databases. In: Proceedings of the ACM SIGMOD, pp 623–634Google Scholar
  11. 11.
    Nehme RV, Rundensteiner EA (2006) Scuba: scalable cluster-based algorithm for evaluating continuous spatio-temporal queries on moving objects. In Proceedings of the EDBT, pp 1001–1019Google Scholar
  12. 12.
    Song Z, Roussopoulos N (2001) K-nearest neighbor search for moving query point. In: Proceedings of 7th international symposium on advances in spatial and temporal databases, Redondo Beach, CA, USA, 12–15 July 2001, pp 79–96Google Scholar
  13. 13.
    Xiong X, Mokbel MF, Aref WG (2005) Sea-cnn: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In: Proceedings of the international conference on data engineering, pp 643–654Google Scholar
  14. 14.
    Yu X, Pu KQ, Koudas N (2005) Monitoring k-nearest neighbor queries over moving objects. In: Proceedings of the international conference on data engineering, pp 631–642Google Scholar
  15. 15.
    Sistla AP, Wolfson O, Chamberlain S, Dao S (1997) Modeling and querying moving objects. In: International conference on data engineering, pp 422–432Google Scholar
  16. 16.
    Wolfson O, Sistla P, Xu B, Zhou J, Chamberlain S, Yesha T, Rishe N (1999) Tracking moving objects using database technology in domino. In: Proceedings of the fourth workshop on next generation information technologies and systems, Zikhron-Yaakov, Israel, July 1999, pp 112–119Google Scholar
  17. 17.
    Dieker S, Guting RH (2000) Plug and play with query algebras: Secondo-a generic dbms development environment. In: Proceedings of the international database engineering and applications symposium, pp 380–392Google Scholar
  18. 18.
    Rigaux P, Scholl M, Segoufin L, Grumbach S (2003) Building a constraint-based spatial database system: model, languages, and implementation. Inf Syst 28(6):563–595CrossRefGoogle Scholar
  19. 19.
    Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: ACM SIGMOD conf, pp 47–57Google Scholar
  20. 20.
    Samet H (1990) Application of spatial data structure. Addison-Wesley, ReadingGoogle Scholar
  21. 21.
    Saltenis S, Jensen CS, Leutenegger ST, Lopez MA (2000) Indexing the positions of continuously moving objects. In: Proceedings of the ACM SIGMOD, pp 331–342Google Scholar
  22. 22.
    Huang Y-K, Chen, C-C, Lee C (2009) Continuous k-nearest neighbor query for moving objects with uncertain velocity. GeoInformatica 13:(1):1–25CrossRefGoogle Scholar
  23. 23.
    Guting H, de Almeida T, Ding Z (2006) Modeling and querying moving objects in networks. VLDB J 15(2):165–190CrossRefGoogle Scholar
  24. 24.
    de Almeida VT, Güting RH (2005) Supporting uncertainty in moving objects in network databases. In: Proceedings of the 13th annual ACM international workshop on geographic information systems, pp 31–40Google Scholar
  25. 25.
    Jensen CS, Kolářvr J, Pedersen TB, Timko I (2003) Nearest neighbor queries in road networks. In: Proceedings of the 11th ACM international symposium on advances in geographic information systems, New York, NY, USA, pp 1–8Google Scholar
  26. 26.
    Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query processing in spatial network databases. In: Proceedings of the 29th international conference on very large data bases, Berlin, Germany, 9–12 September 2003, pp 802–813Google Scholar
  27. 27.
    Kolahdouzan M, Shahabi C (2004) Voronoi-based k nearest neighbor search for spatial network databases. In: Proceedings of the thirtieth international conference on very large data bases, pp 840–851Google Scholar
  28. 28.
    Kolahdouzan MR, Shahabi C (2004) Continuous k-nearest neighbor queries in spatial network databases. In: Proceedings of the 2nd international workshop on spatio-temporal database management, pp 33–40Google Scholar
  29. 29.
    Cho H-J, Chung C-W (2005) An efficient and scalable approach to cnn queries in a road network. In: Proceedings of the 31st international conference on very large data bases, pp 865–876Google Scholar
  30. 30.
    Mouratidis K, Yiu ML, Papadias D, Mamoulis N (2006) Continuous nearest neighbor monitoring in road networks. In: Proceedings of the 32nd international conference on very large data bases, pp 43–54Google Scholar
  31. 31.
    Dai X, Yiu ML, Mamoulis N, Tao Y, Vaitis M (2005) Probabilistic spatial queries on existentially uncertain data. In: Proceedings. International conference on SSTD, pp 400–417Google Scholar
  32. 32.
    Ljosa V, Singh AK (2008) Top-k spatial joins of probabilistic objects. In: International conference on ICDEGoogle Scholar
  33. 33.
    Wolfson O, Chamberlain S, Dao S, Jiang L, Mendez G (1998) Cost and imprecision in modeling the position of moving objects. In: Proceedings of the international conference on innovative data systems research, pp 588–596Google Scholar
  34. 34.
    Wolfson O, Sistla AP, Chamberlain S, Yesha Y (1999) Updating and querying databases that track mobile units. Distributed and Parallel Databases 7(3):257–387CrossRefGoogle Scholar
  35. 35.
    Cheng R, Kalashnikov DV, Prabhakar S (2004) Querying imprecise data in moving object environments. IEEE Trans Knowl Data Eng 16(9):1112–1127CrossRefGoogle Scholar
  36. 36.
    Chen J, Cheng R (2007) Efficient evaluation of imprecise location-dependent queries. In: Proceedings of the international conference on data engineering, pp 586–595Google Scholar
  37. 37.
    Pfoser D, Jensen CS (1999) Capturing the uncertainty of moving-object representations. In: Proceedings of the international conference on scientific and statistical database management, pp 111–132Google Scholar
  38. 38.
    Trajcevski G, Wolfson O, Zhang F, Chamberlain S (2002) The geometry of uncertainty in moving objects databases. In: Proceedings of the international conference on extending database technology, pp 233–250Google Scholar
  39. 39.
    Baeza-Yates R, Ribeiro-Neto B (1999) Modern information retrieval. Addison-Wesley, ReadingGoogle Scholar
  40. 40.
    Papadias D, Shen Q, Tao Y, Mouratidis K (2004) Group nearest neighbor queries. In: Proceedings of the international conference on data engineering, pp 301–312Google Scholar
  41. 41.
    Papadias D, Tao Y, Mouratidis K, Hui CK (2005) Aggregate nearest neighbor queries in spatial databases. ACM Trans Database Syst 30(2):529–576CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Department of Computer Science and Information EngineeringNational Cheng-Kung UniversityTainanRepublic of China

Personalised recommendations