Abstract
The one-shot shortest path query has been studied for decades. However, in the applications on road networks, users are actually interested in the path with the minimum travel time (the fastest path), which varies as time goes. This motivates us to study the continuous evaluation of fastest path queries in order to capture the dynamics of road networks. Repeatedly evaluating a large number of fastest path queries at every moment is infeasible due to its computationally expensive cost. We propose a novel approach that employs the concept of the affecting area and the tolerance parameter to avoid the reevaluation while the travel time of the current answer is close enough to that of the fastest path. Furthermore, a grid-based index is designed to achieve the efficient processing of multiple queries. Experiments on real datasets show significant reduction on the total amount of reevaluation and therefore the cost for reevaluating a query.
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
Agrawal, R., Jagadish, H.: Materialization and Incremental Update of Path Information. In: Proc. Fifth Int’l Conf. Data Eng., pp. 374-383 (1989)
Cormen, T., Lieserson, C., Rivest, R.: Introduction to algorithms (1990)
Esser, J., Schrechenberg, M.: Microscopic Simulation of Urban Traffic Based on Cellular Automata. International Journal of Modern Physics 8, 1025–1036 (1997)
Dijkstra, E.: A Note on Two Problems in Connection with Graphs. Numerische Mathematik 1, 269–271 (1959)
Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Lifelong planning A*. Artificial Intelligence 155, 93–146 (2004)
Fu, L., Rilett, L.: Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research, Methodological 32, 499–516 (1998)
Gupta, S., Kopparty, S., Ravishankar, C.: Roads, Codes, and Spatiotemporal Queries. In: PODS. Proc. of the 19th ACM Symp. on Principles of Database Systems, pp. 13–18. ACM Press, New York (2004)
Huang, Y., Jing, N., Rundensteiner, E.: A Semi-Materialized View Approach for Route Maintenance in Intelligent Vehicle Highway Systems. In: Proc. Second ACM Workshop Geographic Information Systems, pp. 144–151. ACM Press, New York (1994)
Huang, Y., Jing, N., Rundensteiner, E.: Hierarchical Path Views: A Model Based on Fragmentation and Transportation Road Types. In: Proc. Third ACM Workshop Geographic Information Systems, pp. 93–100. ACM Press, New York (1995)
Jing, N., Huang, Y., Rundensteiner, E.: Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation. IEEE Transactions on Knowledge and Data Engineering 10, 409–432 (1998)
Ku, W., Zimmermann, R., Wang, H., Wan, C.: Adaptive Nearest Neighbor Queries in Travel Time Networks. In: Proc. of the 13th annual ACM international workshop on Geographic information systems, ACM Press, New York (2005)
Kanoulas, E., Du, Y., Xia, T., Zhang, D.: Finding Fastest Paths on A Road Network with Speed Patterns. In: 22nd International Conference on Data Engineering (2006)
Nilsson, N.: Problem-Solving Methods. Artificial Intelligence (1971)
Pallottino, S., Scutella, M.: Shortest Path Algorithms in Transportation Models: Classical and Innovative Aspects. Equilibrium and Advanced Transportation Modeling (1998)
Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach (2003)
Shekhar, S., Fetterer, A., Goyal, B.: Materialization Trade-Offs in Hierarchical Shortest Path Algorithms. In: Proc. Of 4th Advances in Spatial and Temporal Databases (1997)
Shahabl, C., Kolahdouzan, M., Sharifzadeh, M.: A Road Network Embedding Technique for K-nearest Neighbor Search in Moving Object Databases. GeoInformatica 7, 255–273 (2003)
Sankaranarayanan, J., Alborzi, H., Samet, H.: Efficient Query Processing on Spatial Networks. In: Proc. of the 13th annual ACM international workshop on Geographic information systems, ACM Press, New York (2005)
http://geodepot.statcan.ca/Diss/2006Dissemination/Data/FRR_RNF_e.cfm
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, CC., Wu, YH., Chen, A.L.P. (2007). Continuous Evaluation of Fastest Path Queries on Road Networks. In: Papadias, D., Zhang, D., Kollios, G. (eds) Advances in Spatial and Temporal Databases. SSTD 2007. Lecture Notes in Computer Science, vol 4605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73540-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-73540-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73539-7
Online ISBN: 978-3-540-73540-3
eBook Packages: Computer ScienceComputer Science (R0)