An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps

In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to speed up the minimum cost route computation. The HiTi graph model provides a novel approach to abstracting and structuring a topographical road map in a hierarchical fashion. We propose a new shortest path algorithm named SPAH, which utilizes HiTi graph model of a topographical road map for its computation. We give the proof for the optimality of SPAH. Our performance analysis of SPAH on grid graphs showed that it significantly reduces the search space over existing methods. We also present an in-depth experimental analysis of HiTi graph method by comparing it with other similar works on grid graphs. Within the HiTi graph framework, we also propose a parallel shortest path algorithm named ISPAH. Experimental results show that inter query shortest path problem provides more opportunity for scalable parallelism than the intra query shortest path problem.

[1]  Shashi Shekhar,et al.  Materialization Trade-Offs in Hierarchical Shortest Path Algorithms , 1997, SSD.

[2]  Elke A. Rundensteiner,et al.  Hierarchical Path Views: A Model Based on Fragmentation and Transportation Road Types , 1995, ACM-GIS.

[3]  Per-Åke Larson,et al.  A file structure supporting traversal recursion , 1989, SIGMOD '89.

[4]  Paul J. Schweitzer,et al.  Problem Decomposition and Data Reorganization by a Clustering Technique , 1972, Oper. Res..

[5]  Elke A. Rundensteiner,et al.  Effective graph clustering for path queries in digital map databases , 1996, CIKM '96.

[6]  Gary L. Miller,et al.  A unified geometric approach to graph separators , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[7]  Valerie King,et al.  A fully dynamic algorithm for maintaining the transitive closure , 1999, STOC '99.

[8]  Elke A. Rundensteiner,et al.  Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation , 1998, IEEE Trans. Knowl. Data Eng..

[9]  S. Azuma,et al.  Map navigation software of the electro-multivision of the '91 Toyoto Soarer , 1991, Vehicle Navigation and Information Systems Conference, 1991.

[10]  Raghu Ramakrishnan,et al.  Transitive closure algorithms based on graph traversal , 1993, TODS.

[11]  Umeshwar Dayal,et al.  Traversal recursion: a practical approach to supporting recursive applications , 1986, SIGMOD '86.

[12]  H. V. Jagadish,et al.  Direct transitive closure algorithms: design and performance evaluation , 1990, TODS.

[13]  Michael Stonebraker,et al.  Heuristic search in database systems , 1986 .

[14]  Ismail Hakki Toroslu,et al.  The efficient computation of strong partial transitive-closures , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[15]  Drew McDermott,et al.  Introduction to artificial intelligence , 1986, Addison-Wesley series in computer science.

[16]  J. Banerjee,et al.  Clustering a DAG for CAD Databases , 1988, IEEE Trans. Software Eng..

[17]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[18]  Stefano Rizzi,et al.  Genetic operators for hierarchical graph clustering , 1998, Pattern Recognit. Lett..

[19]  Peter M. G. Apers,et al.  Data fragmentation for parallel transitive closure strategies , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[20]  Bing Liu,et al.  Integrating case-based reasoning, knowledge-based approach and Dijkstra algorithm for route finding , 1994, Proceedings of the Tenth Conference on Artificial Intelligence for Applications.

[21]  Kien A. Hua,et al.  Efficient evaluation of traversal recursive queries using connectivity index , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[22]  Raghu Ramakrishnan,et al.  A performance study of transitive closure algorithms , 1994, SIGMOD '94.

[23]  David P. Miller,et al.  Hierarchical planning involving deadlines, travel time, and resources , 1988, Comput. Intell..

[24]  David Gelperin,et al.  The optimality of A , 1988 .

[25]  Elke A. Rundensteiner,et al.  Hierarchical optimization of optimal path finding for transportation applications , 1996, CIKM '96.

[26]  Lawrence J. Henschen,et al.  Efficient Algorithms for the Instantiated Transitive Closure Queries , 1991, IEEE Trans. Software Eng..

[27]  Giuseppe F. Italiano,et al.  Incremental algorithms for minimal length paths , 1991, SODA '90.

[28]  H.V. Jagadish,et al.  Materialization and incremental update of path information , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[29]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[30]  Raghu Ramakrishnan,et al.  Efficient Transitive Closure Algorithms , 1988, VLDB.

[31]  H. V. Jagadish,et al.  A compression technique to materialize transitive closure , 1990, TODS.

[32]  Gary L. Miller,et al.  Automatic Mesh Partitioning , 1992 .

[33]  Sabine Timpf,et al.  A Conceptual Model of Wayfinding Using Multiple Levels of Abstraction , 1992, Spatio-Temporal Reasoning.

[34]  H. V. Jagadish,et al.  Algorithms for Searching Massive Graphs , 1994, IEEE Trans. Knowl. Data Eng..

[35]  Earl D. Sacerdoti,et al.  Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.

[36]  Rakesh Agrawal,et al.  An access structure for generalized transitive closure queries , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[37]  Jacob Shapiro,et al.  Level graphs and approximate shortest path algorithms , 1992, Networks.

[38]  Andrew U. Frank,et al.  Theories and Methods of Spatio-Temporal Reasoning in Geographic Space , 1992, Lecture Notes in Computer Science.

[39]  Bin Jiang.  A suitable algorithm for computing partial transitive closures in databases , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[40]  Shashi Shekhar,et al.  Path computation algorithms for advanced traveller information system (ATIS) , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[41]  P.A. Hancock,et al.  Path planning and evaluation in IVHS databases , 1991, Vehicle Navigation and Information Systems Conference, 1991.

[42]  Michael Stonebraker,et al.  Heuristic Search in Data Base Systems , 1984, Expert Database Workshop.

[43]  Shashi Shekhar,et al.  CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations , 1997, IEEE Trans. Knowl. Data Eng..

[44]  Roy Goldman,et al.  Proximity Search in Databases , 1998, VLDB.