Abstract
We investigate the problem of how to evaluate efficiently, with a general algorithm, static or dynamic optimal route queries on a massive graph. A graph is said to be dynamic if its edge weights are changed (increased or decreased) over time. Otherwise, it is static. A route query is static (dynamic) if the underlying graph is static (dynamic, respectively). The answer to an optimal route query is a shortest path that satisfies certain constraints imposed on paths in a graph. Under such a setting, a general and efficient algorithm called DiskOP HBR is proposed to evaluate classes of static or dynamic optimal route queries. The classes of queries that can be evaluated by the algorithm are exactly those the constraints of which can be expressed as a set of edge weight changes. Experiments are conducted on this algorithm to show its desirability.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chan, E.P.F., Zhang, J.: A Fast Unified Optimal Route Query Evaluation Algorithm. In: Proceedings of ACM 16th Conference on Information and Knowledge Management (CIKM 2007), Lisboa, Portugal, November 2007, pp. 371–380 (2007)
Vazirgiannis, M., Wolfson, O.: A Spatial temporal Model and Language for Moving Objects on Road Networks. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 20–35. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, E.P.F., Zhang, J. (2009). Efficient Evaluation of Static and Dynamic Optimal Route Queries. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds) Advances in Spatial and Temporal Databases. SSTD 2009. Lecture Notes in Computer Science, vol 5644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02982-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-02982-0_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02981-3
Online ISBN: 978-3-642-02982-0
eBook Packages: Computer ScienceComputer Science (R0)