Finding alternative shortest paths in spatial networks

ACM Transactions on Database Systems

Volumn 37, Issue 4, 2012, Pages

  Xie, Kexin ^a   Deng, Ke ^a   Shang, Shuo ^a   Zhou, Xiaofang ^a   Zheng, Kai ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

Real time query processing; Shortest paths; Spatial networks

Indexed keywords

ALL PAIRS SHORTEST PATHS; COMPLEX APPLICATIONS; REAL ROAD NETWORKS; SHORTEST PATH; SHORTEST PATH QUERIES; SPATIAL NETWORK; SPATIAL NETWORK DATABASE; STATE-OF-THE-ART APPROACH;

ALGORITHMS; COSTS;

GRAPH THEORY;

EID: 84878502787     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/2389241.2389248     Document Type: Conference Paper

References (28)

1. BALL, M., GOLDEN, B., AND VOHRA, R. 1989. Finding the most vital arcs in a network. Oper. Resear. Lett. 8, 2, 73-76.
2. 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.
3. 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.
4. BRESENHAM, J. E. 1965. Algorithm for computer control of a digital plotter. IBM Syst. J. 4, 25-30.
5. 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. (Pubitemid 43991059)
6. 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.
7. DEMETRESCU, C. AND ITALIANO, G. F. 2004. A new approach to dynamic all pairs shortest paths. J. ACM 51, 968-992. (Pubitemid 40818312)
8. 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.
9. DIJKSTRA, E. 1959. A note on two problems in connexion with graphs. Numerische mathematik 1, 1, 269-271.
10. 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.
11. 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.
12. FREDMAN, M. L. AND TARJAN, R. E. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596-615.
13. 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.
14. FRIGIONI, D., MARCHETTI-SPACCAMELA, A., AND NANNI, U. 2000. Fully dynamic algorithms for maintaining shortest paths trees. J. Algorithms 34, 251-281.
15. 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. (Pubitemid 40851368)
16. 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. (Pubitemid 33068385)
17. HERSHBERGER, J., SURI, S., AND BHOSLE, A. 2007. On the difficulty of some shortest path problems. ACM Trans. Algorithms 3, 5, 1-15.
18. JOHNSON, D. B. 1977. Efficient algorithms for shortest paths in sparse networks. J. ACM 24, 1-13.
19. 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. (Pubitemid 35242613)
20. 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. (Pubitemid 129306185)
21. 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.
22. 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.
23. 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. (Pubitemid 41436106)
24. SAMET, H. 2005. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann Publishers Inc., San Francisco, CA.
25. 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.
26. SANKARANARAYANAN, J. AND SAMET, H. 2009. Distance oracles for spatial networks. In Proceedings of the IEEE International Conference on Data Engineering. IEEE, 652-663.
27. 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.
28. SANKARANARAYANAN, J., SAMET, H., AND ALBORZI, H. 2009. Path oracles for spatial networks. Proc. VLDB Endow. 2, 1210-1221.