Kexin Xie
Shuo Shang
Abstract
Shortest path query is one of the most fundamental queries in spatial network databases. There exist algorithms that can process shortest path queries in real time. However, many complex applications require more than just the calculation of a single shortest path. For example, one of the common ways to determine the importance (or price) of a vertex or an edge in spatial network is to use Vickrey pricing, which intuitively values the vertex v (or edge e) based on how much harder for travelling from the sources to the destinations without using v (or e). In such cases, the alternative shortest paths without using v (or e) are required. In this article, we propose using a precomputation based approach for both single pair alternative shortest path and all pairs shortest paths processing. To compute the alternative shortest path between a source and a destination efficiently, a naïive way is to precompute and store all alternative shortest paths between every pair of vertices avoiding every possible vertex (or edge), which requires O(n4) space. Currently, the state of the art approach for reducing the storage cost is to choose a subset of the vertices as center points, and only store the single-source alternative shortest paths from those center points. Such approach has the space complexity of O(n2 log n). We propose a storage scheme termed iSPQF, which utilizes shortest path quadtrees by observing the relationships between each avoiding vertex and its corresponding alternative shortest paths. We have reduced the space complexity from the naïive O(n4) (or the state of the art O(n4 log n)) to O(min(γ, L)n1.5) with comparable query performance of O(K), where K is the number of vertices in the returned paths, L is the diameter of the spatial network, and γ is a value that depends on the structure of the spatial network, which is empirically estimated to be 40 for real road networks. Experiments on real road networks have shown that the space cost of the proposed iSPQF is scalable, and both the algorithms based on iSPQF are efficient.
- Ball, M., Golden, B., and Vohra, R. 1989. Finding the most vital arcs in a network. Oper. Resear. Lett. 8, 2, 73--76. Google Scholar
Digital Library
- Bernstein, A. and Karger, D. 2008. Improved distance sensitivity oracles via random sampling. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’08). SIAM, Philadelphia, PA, 34--43. Google ScholarDigital Library
- Bernstein, A. and Karger, D. 2009. A nearly optimal oracle for avoiding failed vertices and edges. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC’09). ACM, New York, NY, 101--110. Google ScholarDigital Library
- Bresenham, J. E. 1965. Algorithm for computer control of a digital plotter. IBM Syst. J. 4, 25--30. Google ScholarDigital Library
- Cho, H.-J. and Chung, C.-W. 2005. An efficient and scalable approach to cnn queries in a road network. In Proceedings of the 31st International Conference on Very Large Data Bases (VLDB’05). VLDB Endowment, 865--876. Google ScholarDigital Library
- Chowdhury, R. A. and Ramachandran, V. 2002. Improved distance oracles for avoiding link-failure. In Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC’02). Springer, 523--534. Google ScholarDigital Library
- Demetrescu, C. and Italiano, G. F. 2004. A new approach to dynamic all pairs shortest paths. J. ACM 51, 968--992. Google ScholarDigital Library
- Demetrescu, C., Thorup, M., Chowdhury, R. A., and Ramachandran, V. 2008. Oracles for distances avoiding a failed node or link. SIAM J. Comput. 37, 1299--1318. Google ScholarDigital Library
- Dijkstra, E. 1959. A note on two problems in connexion with graphs. Numerische mathematik 1, 1, 269--271.Google Scholar
- Duan, R. and Pettie, S. 2009. Dual-failure distance and connectivity oracles. In Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’09). SIAM, Philadelphia, PA, 506--515. Google ScholarDigital Library
- Emek, Y., Peleg, D., and Roditty, L. 2008. A near-linear time algorithm for computing replacement paths in planar directed graphs. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’08). SIAM, Philadelphia, PA, 428--435. Google ScholarDigital Library
- Fredman, M. L. and Tarjan, R. E. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596--615. Google ScholarDigital Library
- Frigioni, D., Marchetti-Spaccamela, A., and Nanni, U. 1996. Fully dynamic output bounded single source shortest path problem. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’96). SIAM, Philadelphia, PA, 212--221. Google ScholarDigital Library
- Frigioni, D., Marchetti-Spaccamela, A., and Nanni, U. 2000. Fully dynamic algorithms for maintaining shortest paths trees. J. Algorithms 34, 251--281. Google ScholarDigital Library
- Goldberg, A. V. and Harrelson, C. 2005. Computing the shortest path: A search meets graph theory. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’05). SIAM, Philadelphia, PA, 156--165. Google ScholarDigital Library
- Hershberger, J. and Suri, S. 2001. Vickrey prices and shortest paths: What is an edge worth? In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS’01). IEEE, 252--259. Google ScholarDigital Library
- Hershberger, J., Suri, S., and Bhosle, A. 2007. On the difficulty of some shortest path problems. ACM Trans. Algorithms 3, 5, 1--15. Google ScholarDigital Library
- Johnson, D. B. 1977. Efficient algorithms for shortest paths in sparse networks. J. ACM 24, 1--13. Google ScholarDigital Library
- Jung, S. and Pramanik, S. 2002. An efficient path computation model for hierarchically structured topographical road maps. IEEE Trans. Knowl. Data Engin. 14, 1029--1046. Google ScholarDigital Library
- King, V. 1999. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS’99). IEEE, 81--89. Google ScholarDigital Library
- Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., and Teng, S.-H. 2005. On trip planning queries in spatial databases. In Advances in Spatial and Temporal Databases, C. Bauzer Medeiros, M. Egenhofer, and E. Bertino Eds., Lecture Notes in Computer Science, vol. 3633. Springer, 923--923. Google ScholarDigital Library
- Papadias, D., Zhang, J., Mamoulis, N., and Tao, Y. 2003. Query processing in spatial network databases. In Proceedings of the 29th International Conference on Very Large Data Bases (VLDB’03). VLDB Endowment, 802--813. Google ScholarDigital Library
- Roditty, L. and Zwick, U. 2005. Replacement paths and k simple shortest paths in unweighted directed graphs. In Automata, Languages and Programming, L. Caires, G. Italiano, L. Monteiro, C. Palamidessi, and M. Yung Eds., Lecture Notes in Computer Science, vol. 3580. Springer, 249--260. Google ScholarDigital Library
- Samet, H. 2005. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann Publishers Inc., San Francisco, CA. Google ScholarDigital Library
- Samet, H., Sankaranarayanan, J., and Alborzi, H. 2008. Scalable network distance browsing in spatial databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD’08). ACM, New York, NY, 43--54. Google ScholarDigital Library
- Sankaranarayanan, J. and Samet, H. 2009. Distance oracles for spatial networks. In Proceedings of the IEEE International Conference on Data Engineering. IEEE, 652--663. Google ScholarDigital Library
- Sankaranarayanan, J., Alborzi, H., and Samet, H. 2005. Efficient query processing on spatial networks. In Proceedings of the 13th Annual ACM International Workshop on Geographic Information Systems (GIS’05). ACM, New York, NY, 200--209. Google ScholarDigital Library
- Sankaranarayanan, J., Samet, H., and Alborzi, H. 2009. Path oracles for spatial networks. Proc. VLDB Endow. 2, 1210--1221. Google ScholarDigital Library
Index Terms
- Finding Alternative Shortest Paths in Spatial Networks
Recommendations
Improved algorithms for the k simple shortest paths and the replacement paths problems
Given a directed, non-negatively weighted graph G=(V,E) and s,t@?V, we consider two problems. In the k simple shortest paths problem, we want to find the k simple paths from s to t with the k smallest weights. In the replacement paths problem, we want ...
Replacement paths and k simple shortest paths in unweighted directed graphs
Let G = (V,E) be a directed graph and let P be a shortest path from s to t in G. In the replacement paths problem, we are required to find, for every edge e on P, a shortest path from s to t in G that avoids e. The only known algorithm for solving the ...
Finding next-to-shortest paths in a graph
We study the problem of finding the next-to-shortest paths in a graph. A next-to-shortest (u,v)-path is a shortest (u,v)-path amongst (u,v)-paths with length strictly greater than the length of the shortest (u,v)-path. In contrast to the situation in ...
Comments