Abstract
This paper focuses on processing continuous k nearest neighbor queries over objects moving at uncertain speeds (CUkNN) in road networks. We present a novel model to estimate the distances between objects and a query, both of which move at variable speeds in the road network. Based on the proposed distance model, we present a CUkNN query monitoring method to continuously find the objects that could potentially be the k-nearest neighbors (kNN) of the query. We propose an efficient method to calculate the probability of each object being a kNN of a query. The key thing about the method is that the probability of an object being a kNN of query q is shown to be equivalent to the probability of a special line segment being one of the k-nearest lines from q, which greatly simplifies the probability calculation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cho, H.J., Chung, C.W.: An efficient and scalable approach to CNN queries in a road network. In: VLDB, pp. 865–876 (2005)
Mouratidis, K., Yiu, M.L., Papadias, D., Mamoulis, N.: Continuous Nearest Neighbor Monitoring in Road Networks. In: VLDB, pp. 43–54 (2006)
Huang, Y.-K., Chen, Z.-W., Lee, C.: Continuous K-Nearest Neighbor Query over Moving Objects in Road Networks. In: Li, Q., Feng, L., Pei, J., Wang, S.X., Zhou, X., Zhu, Q.-M. (eds.) APWeb/WAIM 2009. LNCS, vol. 5446, pp. 27–38. Springer, Heidelberg (2009)
Liao, W., Wu, X., Yan, C., Zhong, Z.: Processing of continuous k nearest neighbor queries in road networks. In: Lee, R., Ishii, N. (eds.) Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing. SCI, vol. 209, pp. 31–42. Springer, Heidelberg (2009)
Safar, M.: Enhanced Continuous KNN Queries Using PINE on Road Networks. In: ICDIM, pp. 248–256 (2006)
Trajcevski, G., Tamassia, R., Ding, H., Scheuermann, P., Cruz Isabel, F.: Continuous probabilistic nearest-neighbor queries for uncertain trajectories. In: EDBT, pp. 874–885 (2009)
Chen, J.C., Cheng, R., Mokbel, M., Chow, C.Y.: Scalable processing of snapshot and continuous nearest-neighbor queries over one-dimensional uncertain data. The VLDB Journal 18, 1219–1240 (2009)
Huang, Y.K., Liao, S.J., Lee, C.: Evaluating continuous K-nearest neighbor query on moving objects with uncertainty. Information Systems 34(4-5), 415–437 (2009)
Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query Processing in Spatial Network Databases. In: VLDB, pp. 802–813 (2003)
Kolahdouzan, M.R., Shahabi, C.: Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases. In: VLDB, pp. 840–851 (2004)
Huang, X., Jensen, C.S., Šaltenis, S.: The islands approach to nearest neighbor querying in spatial networks. In: Anshelevich, E., Egenhofer, M.J., Hwang, J. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 73–90. Springer, Heidelberg (2005)
Wang, H., Zimmermann, R.: Location-based Query Processing on Moving Objects in Road Networks. In: VLDB, pp. 321–332 (2007)
http://www.fh-oow.de/institute/iapg/personen/brinkhoff/generator/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, G., Li, Y., Shu, L., Fan, P. (2011). CkNN Query Processing over Moving Objects with Uncertain Speeds in Road Networks. In: Du, X., Fan, W., Wang, J., Peng, Z., Sharaf, M.A. (eds) Web Technologies and Applications. APWeb 2011. Lecture Notes in Computer Science, vol 6612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20291-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-20291-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20290-2
Online ISBN: 978-3-642-20291-9
eBook Packages: Computer ScienceComputer Science (R0)