Abstract
We present a novel graph embedding to speed-up distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph that is applicable also for very large networks. Our method extends an existing embedding called reference node embedding which can be used to compute accurate lower and upper bounding filters for the true shortest path distance. In order to solve the problem of high storage cost for the network embedding, we propose a novel concept called hierarchical embedding that scales well to very large traffic networks. Our experimental evaluation on several real-world data sets demonstrates the benefits of our proposed concepts, i.e. efficient query processing and reduced storage cost, over existing work.
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
Dijkstra, E.W.: A Note on Two Problems in Connection with Graphs. Numerische Mathematik 1, 269–271 (1959)
Corman, T.H., Leiserson, C.E., Riverst, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)
Kung, R., Hanson, E., Ioannidis, Y., Sellis, T., Shapiro, L., Stonebraker, M.: Heuristic Search in Data Base Systems. Expert Database Systems (1986)
Agrawal, R., Dar, S., Jagadish, H.: Direct Transitive Closure Algorithms: Design and Performance Evaluation. TODS 15(3) (1990)
Ioannidis, Y., Ramakrishnan, R., Winger, L.: Transitive Closure Algorithms Based on Graph Traversal. TODS 18(3) (1993)
Jung, S., Pramanik, S.: HiTi Graph Model of Topographical Roadmaps in Navigation Systems. In: Proc. Int. Conf. on Data Engineering (ICDE 1996) (1996)
Köhler, E., Möhring, R.H., Schilling, H.: Acceleration of Shortest Path and Constrained Shortest Path Computation. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 126–138. Springer, Heidelberg (2005)
Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query Processing in Spatial Network Databases. In: Proc. Int. Conf. on Very Large Databases (VLDB 2003) (2003)
Shahabi, C., Kolahdouzan, M., Sharifzadeh, M.: A Road Network Embedding Technique for k-Nearest Neighbor Search in Moving Object Databases. Geoinformatica 7(3), 255–273 (2003)
Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. In: Proc. IEEE Symp. Foundations of Computer Science (1994)
Hu, H., Lee, D.L., Lee, V.C.S.: Distance Indexing on Road Networks. In: Proc. Int. Conf. on Very Large Databases (VLDB 2006) (2006)
Goldberg, A.V., Werneck, R.F.: Computing Point-to-Point Shortest Paths from External Memory. In: Proc. of the 7th WS on Algorithm Engineering and Experiments (ALENEX). SIAM, Philadelphia (2005)
Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Efficient point-to-point shortest path algorithms’. In: Proc. of the 8th WS on Algorithm Engineering and Experiments (ALENEX). SIAM, Philadelphia (2006)
Kriegel, H.P., Kröger, P., Kunath, P., Renz, M., Schmidt, T.: Proximity Queries in Large Traffic Networks. In: Proc. 15th Int. Symposium on Advances in Geographic Information Systeme (ACM GIS 2007), Seattle, WA (2007)
Kolahdouzan, M., Shahabi, C.: Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases. In: Proc. Int. Conf. on Very Large Databases (VLDB 2004) (2004)
Kolahdouzan, M., Shahabi, C.: Continuous K-Nearest Neighbor Queries in Spatial Network Databases. In: Proc. of STDBM 2004 (2004)
Cho, H.J., Chung, C.W.: An efficient and scalable approach to cnn queries in a road network. In: Proc. Int. Conf. on Very Large Databases (VLDB 2005) (2005)
Kriegel, H.P., Kröger, P., Kunath, P., Renz, M.: Generalizing the Optimality of Multi-Step k-Nearest Neighbor Query Processing. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol. 4605, pp. 75–92. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kriegel, HP., Kröger, P., Renz, M., Schmidt, T. (2008). Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks. In: Ludäscher, B., Mamoulis, N. (eds) Scientific and Statistical Database Management. SSDBM 2008. Lecture Notes in Computer Science, vol 5069. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69497-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-69497-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69476-2
Online ISBN: 978-3-540-69497-7
eBook Packages: Computer ScienceComputer Science (R0)