Abstract
In this paper, we propose a method to incrementally maintain all-nearest neighbors on road network. The nearest neighbor on road network is computed based on the path length between a pair of objects. To achieve an efficient maintenance process of all-nearest neighbors on road network, the cost of path search should be decreased. A method is proposed for efficient path search by minimizing the search region based on the previous results and heuristics.
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
Hjaltason, G.R.: Incremental distance join algorithms for spatial databases. In: Proc. Of ACM SIGMOD 1998, pp. 237–248 (1998)
Guttman, A.: R-Trees: A dynamic index structure for spatial searching. In: Proc. of ACM SIGMOD 1984, pp. 47–57 (1984)
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)
Feng, J., Watanabe, T.: A Fast Search Method of Nearest Target Object in Road Networks. Journal of the ISCIE 16(9), 484–491 (2003)
Christofides, N.: Graph Theory: An Algorithmic Approach. Academic Press Inc. ltd., London (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feng, J., Mukai, N., Watanabe, T. (2004). Incremental Maintenance of All-Nearest Neighbors Based on Road Network. In: Orchard, B., Yang, C., Ali, M. (eds) Innovations in Applied Artificial Intelligence. IEA/AIE 2004. Lecture Notes in Computer Science(), vol 3029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24677-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-24677-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22007-7
Online ISBN: 978-3-540-24677-0
eBook Packages: Springer Book Archive