Introduction to algorithms
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
Effective graph clustering for path queries in digital map databases
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Hierarchical optimization of optimal path finding for transportation applications
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
IEEE Transactions on Knowledge and Data Engineering
Materialization Trade-Offs in Hierarchical Shortest Path Algorithms
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Reverse Nearest Neighbors in Large Graphs
IEEE Transactions on Knowledge and Data Engineering
Optimization and evaluation of shortest path queries
The VLDB Journal — The International Journal on Very Large Data Bases
Dynamic route planning for car navigation systems using virus genetic algorithms
International Journal of Knowledge-based and Intelligent Engineering Systems
The optimal sequenced route query
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Keyword search on external memory data graphs
Proceedings of the VLDB Endowment
Efficiently indexing shortest paths by exploiting symmetry in graphs
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Reducing the memory required to find a geodesic shortest path on a large mesh
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Fast paths in large-scale dynamic road networks
Computational Optimization and Applications
Answering pattern match queries in large graph databases via graph embedding
The VLDB Journal — The International Journal on Very Large Data Bases
Spatial big-data challenges intersecting mobility and cloud computing
MobiDE '12 Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
A hybrid approach for adaptive car navigation
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part III
| Hi-index | 0.00 |
This paper describes a disk-based algorithm for finding shortest paths in a large network system. It employs a strategy of processing the network piece by piece and is based on new algorithms for graph partitioning and for finding shortest paths that overcome the problem of existing approaches. To show that it is scalable to large network systems and is adaptable to different computing environments, seven states in Tiger/Line files are extracted as test cases and are experimented on machines with different configurations. The running time for finding the shortest path depends primarily on the power of the underlying systems. Moreover, to run the algorithm optimally, the memory requirement is not large, even for a very large network system such as the road system in several states in Tiger/Line file. To evaluate its performance, New Mexico state road system is used as the test case, and is compared with Dijkstra's algorithm. The average running time of the proposed algorithm is, in the worst case, about two and a half times slower than that of Dijkstra's algorithm; provided that in Dijkstra's algorithm, the whole graph can be fit into main memory and is already loaded in advance. If the I/O time for loading the whole graph is counted, the proposed algorithm is faster in essentially all cases.