Materialization trade-offs in hierarchical shortest path algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1262 LNCS, Issue , 1997, Pages 94-111

  Shekhar, Shashi ^a   Fetterer, Andrew ^a   Goyal, Brajesh ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION TIME; HIERARCHICAL ROUTING ALGORITHM; INTELLIGENT TRANSPORTATION SYSTEMS; QUERYING DATABASE; SHORTEST PATH ALGORITHMS; SPATIAL GRAPHS; STORAGE OVERHEAD; TIME-CRITICAL APPLICATIONS;

COST REDUCTION; GRAPHIC METHODS; INTELLIGENT SYSTEMS; ROUTING ALGORITHMS;

GRAPH THEORY;

EID: 84885602912     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63238-7_26     Document Type: Conference Paper

References (18)

1. R. Agrawal. "Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries". IEEE Trans. on Software Engineering, 14(7), 1988.
2. W.C. Collier and R.J. Weiland. "Smart Cars, Smart Highways". IEEE Spectrum, pages 27-33, April 1994.
3. Greg Prederickson. "Searching Among Intervals and Compact Routing Tables". Algorithmica, pages 448-466, 1996.
4. Hector Garcia-Molina and Kenneth Salem. Main Memory Database Systems: An Overview. IEEE Transactions on Knowledge and Data Engineering, 4(6):509-516, 1992.
5. R. H. Guting. GraphDB: Modeling and Querying Graphs in Databases. In Proc. of Intl. Conference on Very Large Data Bases, 1994.
6. Y. Ioannidis, R. Ramakrishnan, and L. Winger. "Transitive Closure Algorithms Based on Graph Traversal". ACM Trans, on Database Systems, 18(3), September 1993.
7. H.V. Jagadish, R. Agrawal, and L. Ness. "A Study of Transitive Closure As a Recursion Mechanism". In Proc. of SIGMOD Intl. Conference on Management of Data. ACM, 1987.
8. B. Jiang. "I/O Efficiency of Shortest Path Algorithms: An Analysis". In Proc. of the Intl. Conference on Data Engineering. IEEE, 1992.
9. Ning Jing, Yun-Wu Huang, and Elke Rudensteiner. "Hierarchical Optimization of Optimal Path Finding for Transportation Applications". In Proc. of ACM Conference on Information and Knowledge Management, 1996.
10. George Karypis and Vipin Kumar. "Analysis of Multilevel Graph Partitioning". Technical Report 95-037 see also http://www.cs.urrm.edu/ ~karypis, University of Minnesota, Department of Computer Science, Minneapolis, MN 55455, August 1995.
11. Leonard Kleinrock and Farouk Kamoun. "Hierarchical Routing for Large Networks". Computer Networks, 1:154-174, 1977.
12. R. Kung, E. Hanson, and et al. "Heuristic Search in Data Base Systems". In Proc. Expert Database Systems. Benjamin Cummings Publications, 1986.
13. Y. Kusumi, S. Nishio, and T. Hasegawa. "File Access Level Optimization Using Page Access Graph on Recursive Query Evaluation". In Proc. Conference on Extending Database Technology. EDTB, 1988.
14. H. Lu, K. Mikkilineni, and J.P. Richardson. "Design and Evaluation of Algorithms to Compute the Transitive Closure of a Database Relation". In Proc. of Intl Conference on Data Engineering. IEEE, 1987.
15. S. Shekhar, A. Kohli, and M. Coyle. Path Computation Algorithms for Advanced Traveler Information Systems. In Proc. of the 9th Intl. Conference on Data Engineering, 1993.
16. S. Shekhar and D. R. Liu. "A Connectivity-Clustered Access Method for Networks and Network Computation". In Proc. Intl. Conf. on Data Engineering, 1995. Complete version to appear in IEEE Transactions on Knowledge and Data Engineering.
17. Shashi Shekhar, Andrew Fetterer, and Brajesh Goyal. A Comparison of Hierarchical Algorithms for Shortest Path Computation in Advanced Travel Information Systems. Technical Report 96-046, University of Minnesota, 1996.
18. Gang Zhou, Richard Hull, Roger King, and Jean-Claude Franhitti. "Data Integration and Warehousing Using H20". Bulletin of the Technical Committee of Data Engineering, 18(2):29-40, June 1995.