Abstract
One of the important types of queries in spatio-temporal databases is the Continuous K-Nearest Neighbor (CKNN) query, which is to find among all moving objects the K-Nearest Neighbors (KNNs) of a mobile user at each time instant within a user-given time interval [t s , t e ]. In this paper, we focus on how to process such a CKNN query efficiently when the moving speed and direction of each moving object are uncertain. We thoroughly analyze the complicated problems incurred by this uncertainty and propose a Continuous PKNN (CPKNN) algorithm to effectively tackle these problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Huang, Y.-K., Chen, C.-C., Lee, C.: Continuous k-nearest neighbor query for moving objects with uncertain velocity. Accepted and to appear in GeoInformatica (available online)
Huang, Y.-K., Liao, S.-J., Lee, C.: Efficient continuous k-nearest neighbor query processing over moving objects with uncertain speed and direction. Technical Report TR-03-27, Department of Computer Science and Information Engineering, National Cheng Kung University
Iwerks, G., Samet, H., Smith, K.: Continuous k-nearest neighbor queries for continuously moving points with updates. In: Proceedings of the International Conference on Very Large Data Bases, Berlin, Germany (2003)
Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring. In: Proceedings of the ACM SIGMOD (2005)
Raptopoulou, K., Papadopoulos, A., Manolopoulos, Y.: Fast nearest-neighbor query processing in moving-object databases. GeoInformatica 7(2), 113–137 (2003)
Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the positions of continuously moving objects. In: Proceedings of the ACM SIGMOD (2000)
Song, Z., Roussopoulos, N.: 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 (2001)
Tao, Y., Papadias, D.: Time parameterized queries in spatio-temporal databases. In: Proceedings of the ACM SIGMOD, Madison, Wisconsin (2002)
Tao, Y., Papadias, D., Shen, Q.: Continuous nearest neighbor search. In: Proceedings of the International Conference on Very Large Data Bases, Hong Kong, China (2002)
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 the International Conference on Data Engineering (2005)
Yu, X., Pu, K.Q., Koudas, N.: Monitoring k-nearest neighbor queries over moving objects. In: Proceedings of the International Conference on Data Engineering (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, YK., Liao, SJ., Lee, C. (2008). Efficient Continuous K-Nearest Neighbor Query Processing over Moving Objects with Uncertain Speed and Direction. In: Ludäscher, B., Mamoulis, N. (eds) Scientific and Statistical Database Management. SSDBM 2008. Lecture Notes in Computer Science, vol 5069. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69497-7_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-69497-7_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69476-2
Online ISBN: 978-3-540-69497-7
eBook Packages: Computer ScienceComputer Science (R0)