Optimization and evaluation of shortest path queries

VLDB Journal

Volumn 16, Issue 3, 2007, Pages 343-369

  Chan, Edward P F ^a   Lim, Heechul ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Disk based algorithms; Graph algorithms; Graph pruning; Query evaluation and optimization; Route queries; Shortest path queries

Indexed keywords

EID: 34249091396     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00778-005-0177-1     Document Type: Article

References (18)

1. Agrawal, R., Jagadish, H.V.: Algorithms for searching massive graphs. IEEE Trans. on Knowl. Data Eng. 6(2), 225-238 (1994)
2. Bancilhon, F., Ramakrishnan, R.: An Amateur's introduction to recursive query processing strategies. In: Proceedings of Sigmod, pp. 16-52 (1996)
3. Chan, E.P.F., Zhang, N.: Finding shortest paths in large network systems. In: Proceedings of the 9th ACM International Workshop on Advances in Geographic Information Systems. (ACM-GIS 2001). pp. 160-166 Atlanta, Georgia (2001)
4. Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest path algorithms: theory and experimental evaluation. Mathematical Programming. 73, 129-174 (1996)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MIT Press (1990)
6. Goldman, R., Shivakumar, N., Venkatasubramanian, S., Garcia-Molina H.: Proximity search in databases. In: Proceedings of the 24th VLDB Conference, pp. 26-37 New York (1998)
7. Hutchinson, D., Maheshwari, A., Zeh, Z.: An external-memory data structure for shortest path queries. In: Proceedings of the 5th Annual Combinatorics and Computing Conference (COCOON 99), Tokyo, July 26-28, 1999, Lecture Notes in Computer Science, vol. 1627, pp. 51-60, Springer Verlag (1999)
8. Ioannidis, Y., Ramakrishnan, R.: Efficient Transitive Closure Algorithms, In: Proceedings of 14th VLDB Conference, pp. 382-394 (1988)
9. Jagadish, H.V.: A compression technique to materialize transitive closure. ACM Trans. Database Sys. 14(4), 558-598 (1990)
10. Jing, N., Huang, Y.W., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE Trans. Knowl. Data Eng. 10(3), 1-23 (1998)
11. Jung, S., Pramanik, S.: An efficient path computation model for hierarchicallly structured topographical road maps. IEEE Trans. Knowl. Data Eng. 14(5), 1029-1046 (2002)
12. Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 177-189 (1979)
13. Merrett, T.H., Kambayashi, Y., Yasuura, H.: Scheduling of Page-Fetches in Join Operation. In: Proceedings of the Seventh International Conference on VLDB. pp. 488-497 Cannes, France (1981)
14. Shekhar, S., Fetterer, A., Goyal, B.: Materialization Trade-Offs in Hierarchical Shortest Path Algorithms. In: Proceedings of the 5th International Symposium on Large Spatial Databases, Lecture Nodes in Computer Science 1262, Springer Verlag pp. 94-111 (1997)
15. Tiger/Line Files, US Department of Commerce Economics and Statistics Administration, Bureau of Census (1998)
16. Valduriez, P., Boral, H.: Evaluation of recursive queries using join indices. In: Proceedings of 12th International Conference on VLDB. pp. 403-411, Kyoto, Japan (1986)
17. Vazirgiannis, M., Wolfson, O.: A Spatialtemporal Model and Language for Moving Objects on Road Networks. In: Proceedings of the 7th International Symposium on Spatial and Temporal Databases (STTD 2001), pp. 20-35. L.A., CA, (2001)
18. Zeh, N.: An external-memory data structure for shortest path queries. Diplomarbeit, Friedrich-Schiller-Universitit Jena (1998)