Abstract
Fast shortest path search between two points on a road network is essential demand in location based services (LBS). For this purpose, several types of road network distance materialization methods have been studied. The distance materialization approach is quite fast, however, it results in a huge amount of data. This paper proposes a shortest path search algorithm based on materialized-path-view constructed only on partitioned subgraphs, and its three variations referring different levels of distance materialization. The amount of pre-computed data is greatly reduced. The shortest path is retrieved by a best-first-search using a priority queue. The difference between three variations of the algorithm is the materialization level of the distance in the subgraphs. The performance of them is evaluated comparing with A* algorithm and HEPV experimentally. Through the results, we show the proposed algorithm outperforms the conventional methods.
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
Jing, N., Huang, Y.W., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE Transactions on Knowledge and Data Engineeing 10(3), 409–432 (1998)
Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. IEEE Transactions on Knowledge and Data Engineering 14(5), 1029–1046 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hlaing, A.T., Htoo, H., Ohsawa, Y., Sonehara, N., Sakauchi, M. (2013). Shortest Path Finder with Light Materialized Path View for Location Based Services. In: Wang, J., Xiong, H., Ishikawa, Y., Xu, J., Zhou, J. (eds) Web-Age Information Management. WAIM 2013. Lecture Notes in Computer Science, vol 7923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38562-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-38562-9_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38561-2
Online ISBN: 978-3-642-38562-9
eBook Packages: Computer ScienceComputer Science (R0)