Abstract
Nearest neighbor (NN) queries have been extended from Euclidean spaces to road networks. Existing approaches are either based on Dijkstra-like network expansion or NN/distance precomputation. The former may cause an explosive number of node accesses for sparse datasets because all nodes closer than the NN to the query must be visited. The latter, e.g., the Voronoi Network Nearest Neighbor (VN 3) approach, can handle sparse datasets but is inappropriate for medium and dense datasets due to its high precomputation and storage overhead. In this paper, we propose a new approach that indexes the network topology based on a novel network reduction technique. It simplifies the network by replacing the graph topology with a set of interconnected tree-based structures called SPIE’s. An nd index is developed for each SPIE and our new (k)NN search algorithms on an SPIE follow a predetermined tree path to avoid costly network expansion. By mathematical analysis and experimental results, our new approach is shown to be efficient and robust for various network topologies and data distributions.
This work is supported by the Research Grants Council, Hong Kong SAR under grant HKUST6277/04E.
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
Berchtold, S., Keim, D.A., Kriegel, H.-P., Seidl, T.: Indexing the solution space: A new technique for nearest neighbor search in high-dimensional space. TKDE 12(1), 45–57 (2000)
Cho, H.-J., Chung, C.-W.: An efficient and scalable approach to cnn queries in a road network. In: VLDB (2005)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw Hill, New York (2001)
Dijkstra, E.W.: A note on two problems in connection with graphs. Numeriche Mathematik 1, 269–271 (1959)
Hanson, E., Ioannidis, Y., Sellis, T., Shapiro, L., Stonebraker, M.: Heuristic search in data base systems. Expert Database Systems (1986)
Jensen, C.S., Kolarvr, J., Pedersen, T.B., Timko, I.: Nearest neighbor queries in road networks. In: 11th ACM International Symposium on Advances in Geographic Information Systems (GIS 2003), pp. 1–8 (2003)
Kolahdouzan, M., Shahabi, C.: Continuous k-nearest neighbor queries in spatial network databases. In: STDBM (2004)
Kolahdouzan, M., Shahabi, C.: Voronoi-based k nearest neighbor search for spatial network databases. In: VLDB Conference, pp. 840–851 (2004)
Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: VLDB Conference, pp. 802–813 (2003)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD Conference, San Jose, California, pp. 71–79 (1995)
Shahabi, C.K., Kolahdouzan, M.R., Sharifzadeh, M.: A road network embedding technique for knearest neighbor search in moving object databases. In: 10th ACM International Symposium on Advances in Geographic Information Systems, GIS 2002 (2002)
Shekhar, S., Liu, D.R.: Ccam: A connectivity-clustered access method for networks and network computations. IEEE Transactions on Knowledge and Data Engineering 1(9), 102–119 (1997)
Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of the 24rd International Conference on Very Large Data Bases, pp. 194–205 (1998)
Xu, J., Tang, X., Lee, D.L.: Performance analysis of location-dependent cache invalidation schemes for mobile environments. IEEE Transactions on Knowledge and Data Engineering 15(2), 474–488 (2003)
Yu, C., Ooi, B.C., Tan, K.-L., Jagadish, H.V.: Indexing the distance: An efficient method to knn processing. In: VLDB Conference, Roma, pp. 421–430 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, H., Lee, D.L., Xu, J. (2006). Fast Nearest Neighbor Search on Road Networks. In: Ioannidis, Y., et al. Advances in Database Technology - EDBT 2006. EDBT 2006. Lecture Notes in Computer Science, vol 3896. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11687238_14
Download citation
DOI: https://doi.org/10.1007/11687238_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32960-2
Online ISBN: 978-3-540-32961-9
eBook Packages: Computer ScienceComputer Science (R0)