Abstract
In this paper, we focus on a typical situation of LBS which is to provide services for users in cars that move in a road network. For such kind of users, the problem of k-CNN search along a specific route on road network is to find out k nearest neighbor (k-NN) objects for any place on the route. k nearest neighbors are selected based on the path length from the route to the objects, and the continuous search for all the points on the route should be considered. A k-CNN search method is proposed by using an incremental k-NN search based on road network.
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
Hjaltson, G., Samet, H.: Incremental distance join algorithms for spatial databases. In: Proc. of ACM-SIGMOD, pp. 237–248 (1998)
Tao, Y.F., Papadias, D., Shen, Q.M.: Continuous nearest neighbor search. In: Proc. of VLDB 2002, pp. 287–298 (2002)
Song, Z.X., 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)
Bespamyatnikh, S., Snoeyink, J.: Queries with segments in voronoi diagrams. In: SODA (1999)
Jacox, E.H., Samet, H.: Iterative spatial join. ACM Trans. Database Syst. 28, 230–256 (2003)
Lee, D.H., Kim, H.J.: An efficient technique for nearest-neighbor query processing on the spy-tec. IEEE Trans. on Knowledge and Data Engineering 15, 1472–1486 (2003)
Shin, H., Moon, B., Lee, S.: Adaptive and incremental processing for distance join queries. IEEE Trans. on Knowledge and Data Engineering 15, 1561–1578 (2003)
Hjaltson, G., Samet, H.: Distance browsing in spatial databases. ACM Transactions on Database Systems 24, 265–318 (1999)
Feng, J., Mukai, N., Watanabe, T.: Multi-level transportation network adaptable to traffic navigation. In: Orchard, B., Yang, C., Ali, M. (eds.) IEA/AIE 2004. LNCS (LNAI), vol. 3029, pp. 164–169. Springer, Heidelberg (2004)
Feng, J., Watanabe, T.: A fast search method of nearest target object in road networks. Journal of the ISCIE 16, 484–491 (2003)
Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. of ACM SIGMOD 1984, pp. 47–57 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feng, J., Mukai, N., Watanabe, T. (2005). 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: Theory and Practice of Computer Science. SOFSEM 2005. Lecture Notes in Computer Science, vol 3381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30577-4_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-30577-4_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24302-1
Online ISBN: 978-3-540-30577-4
eBook Packages: Computer ScienceComputer Science (R0)