Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"Shortest Path Query"”.

  1. Evaluation of Shortest Path Query Algorithm in Spatial Databases

    Many variations of algorithms for finding the shortest path in a large graph have been introduced recently due to the needs of applications like the Geographic Information System (GIS) or Intelligent Transportation System (ITS). The primary subjects of those algorithms are materialization and …

    waterloo Repository record for Evaluation of Shortest Path Query Algorithm in Spatial Databases (opens in a new tab)

  2. Comparative Study of Speed-Up Routing Algorithms in Road Networks

    We study the problem of finding the shortest distance and the shortest path from one node to another in graphs modeling large road networks. Classical algorithms like Dijkstra and Astar do not have good performance in such networks. In recent years, two new approaches called Contraction Hierarchy …

    concordia Download PDF for Comparative Study of Speed-Up Routing Algorithms in Road Networks (opens in a new tab)

  3. Fast trips: A scalable insertion operator approach for ridesharing over time-dependent road networks

    … This method reduces the large number of shortest path query invocations inherent to time-dependent insertions, significantly decreasing RPSM simulation speeds without sacrificing, and in some cases even improving the quality of the solutions. Through extensive experimental evaluations …

    uvic Repository record for Fast trips: A scalable insertion operator approach for ridesharing over time-dependent road networks (opens in a new tab)

  4. Towards Efficient Shortest Path Related-Queries on Large-Scale Graphs

    … the significant challenges in graph analysis, shortest-path computation plays a critical role due to its ubiquitous applications in routing, optimization, and data mining. This thesis addresses advanced shortest-path query problems within graph databases, with particular emphasis on scalability …

    unsw Repository record for Towards Efficient Shortest Path Related-Queries on Large-Scale Graphs (opens in a new tab)