Abstract
Continuous K nearest neighbor (CkNN) queries under mobile environment are defined as the k nearest neighbors search for a query object at a serial query time, and all the query object and the target objects are moving. In this paper, we propose method to solve this problem, focusing on finding out the relations between the continuous queries, and proposing decision method for relative moving trend among moving objects. Our experiments show that our approach outperforms the original straightforward method, specially when the query interval is small.
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
Kolahdouzan, M.R., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. In: Proceedings of the 30th Very Large DataBase, pp. 840–851 (2004)
Bespamyatnikh, S., Snoeyink, J.: Queries with segments in voronoi diagrams. In: SODA (1999)
Kolahdouzan, M.R., Shahabi, C.: Continuous k nearest neighbor queries in spatial network databases. In: Proceedings of the Second Workshop on Spatio-Temporal Database Management, pp. 33–40 (2004)
Tao, Y.F., Papadias, D., Shen, Q.M.: Continuous nearest neighbor search. In: Proc. of VLDB’02, pp. 287–298 (2002)
Song, Z., Roussopoulos, N.: K-Nearest Neighbor Search for Moving Query Point. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 79–96. Springer, Heidelberg (2001)
Feng, J., Watanabe, T.: A fast method for continuous nearest target objects query on road network. In: Proc. of VSMM’02, pp. 182–191 (2002)
Feng, J., Mukai, N., Watanabe, T.: Stepwise Optimization Method for k-CNN Search for Location-Based Service. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 368–371. Springer, Heidelberg (2005)
Feng, J., Zhu, Y., Mukai, N., Watanabe, T.: Search on Transportation Network for Location-Based Service. In: Ali, M., Esposito, F. (eds.) IEA/AIE 2005. LNCS (LNAI), vol. 3533, pp. 657–666. Springer, Heidelberg (2005)
Li, Y., Yang, J., Han, J.: Continuous k-nearest neighbor search for moving objects. In: SSDBM, pp. 123–126 (2004)
Jensen, C.S., Kolvr, J., Bach Pedersen, T., Timko, I.: Nearest neighbor queries in road networks. In. In: GIS ’03: Proceedings of the 11th ACM international symposium on Advances in geographic information systems, pp. 1–8. ACM Press, New York (2003)
Tao, Y.F., Papadias, D., Sun, J.M.: The tpr*-tree: An optimized spatio-temporal access method for predictive queries. In: Proc. of VLDB’03, pp. 790–801 (2003)
Hjaltson, G.R., Samet, H.: Distance browsing in spatial databases. ACM Transactions on Database Systems 24(2), 265–318 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Feng, J., Wu, L., Zhu, Y., Mukai, N., Watanabe, T. (2007). Continuous k-Nearest Neighbor Search Under Mobile Environment. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds) Advances in Data and Web Management. APWeb WAIM 2007 2007. Lecture Notes in Computer Science, vol 4505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72524-4_58
Download citation
DOI: https://doi.org/10.1007/978-3-540-72524-4_58
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72483-4
Online ISBN: 978-3-540-72524-4
eBook Packages: Computer ScienceComputer Science (R0)