Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Heuristic search in database systems
Proceedings from the first international workshop on Expert database systems
Introduction to artificial intelligence
Introduction to artificial intelligence
Clustering a DAG for CAD Databases
IEEE Transactions on Software Engineering
A parallel shortest path algorithm
Computing
A file structure supporting traversal recursion
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Direct transitive closure algorithms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
Efficient Algorithms for the Instantiated Transitive Closure Queries
IEEE Transactions on Software Engineering
A unified geometric approach to graph separators
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Transitive closure algorithms based on graph traversal
ACM Transactions on Database Systems (TODS)
A performance study of transitive closure algorithms
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
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
A fully dynamic algorithm for maintaining the transitive closure
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Genetic operators for hierarchical graph clustering
Pattern Recognition Letters
Incremental algorithms for minimal length paths
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Algorithms for Searching Massive Graphs
IEEE Transactions on Knowledge and Data Engineering
CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
A Suitable Algorithm for Computing Partial Transitive Closures in Databases
Proceedings of the Sixth International Conference on Data Engineering
Data fragmentation for parallel transitive closure strategies
Proceedings of the Ninth International Conference on Data Engineering
Efficient Evaluation of Traversal Recursive Queries Using Connectivity Index
Proceedings of the Ninth International Conference on Data Engineering
An Access Structure for Generalized Transitive Closure Queries
Proceedings of the Ninth International Conference on Data Engineering
The Efficient Computation of Strong Partial Transitive-Closures
Proceedings of the Ninth International Conference on Data Engineering
Path Computation Algorithms for Advanced Traveller Information System (ATIS)
Proceedings of the Ninth International Conference on Data Engineering
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Efficient Transitive Closure Algorithms
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Materialization Trade-Offs in Hierarchical Shortest Path Algorithms
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
A Conceptual Model of Wayfinding Using Multiple Levels of Abstraction
Proceedings of the International Conference GIS - From Space to Territory: Theories and Methods of Spatio-Temporal Reasoning on Theories and Methods of Spatio-Temporal Reasoning in Geographic Space
Materialization and Incremental Update of Path Information
Proceedings of the Fifth International Conference on Data Engineering
Aggregate Nearest Neighbor Queries in Road Networks
IEEE Transactions on Knowledge and Data Engineering
Geometric containers for efficient shortest-path computation
Journal of Experimental Algorithmics (JEA)
Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
Combining speed-up techniques for shortest-path computations
Journal of Experimental Algorithmics (JEA)
K nearest neighbor search in navigation systems
Mobile Information Systems
Optimization and evaluation of shortest path queries
The VLDB Journal — The International Journal on Very Large Data Bases
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A fast unified optimal route query evaluation algorithm
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Engineering multilevel overlay graphs for shortest-path queries
Journal of Experimental Algorithmics (JEA)
A Web Based Pathfinder Service for Road Networks in India
ICDCIT '08 Proceedings of the 5th International Conference on Distributed Computing and Internet Technology
On-line exact shortest distance query processing
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Fast object search on road networks
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Instance optimal query processing in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
On A☆ search with stopover areas
International Journal of Geographical Information Science
Navigational path privacy protection: navigational path privacy protection
Proceedings of the 18th ACM conference on Information and knowledge management
Monitoring minimum cost paths on road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Virtual social networks online and mobile systems
Mobile Information Systems
Efficient and scalable multi-geography route planning
Proceedings of the 13th International Conference on Extending Database Technology
Efficient successor retrieval operations for aggregate query processing on clustered road networks
Information Sciences: an International Journal
Shortest path computation on air indexes
Proceedings of the VLDB Endowment
Neighborhood-privacy protected shortest distance computing in cloud
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Dynamic pickup and delivery with transfers
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Context-aware nearest neighbor query on social networks
SocInfo'11 Proceedings of the Third international conference on Social informatics
A safe-exit approach for efficient network-based moving range queries
Data & Knowledge Engineering
An efficient shortest path computation system for real road networks
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Dynamic skyline queries in large graphs
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Shortest path and distance queries on road networks: an experimental evaluation
Proceedings of the VLDB Endowment
Shortest path computation with no information leakage
Proceedings of the VLDB Endowment
Effective caching of shortest paths for location-based services
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
A highway-centric labeling approach for answering distance queries on large sparse graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Scalable computation of isochrones with network expiration
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Finding Alternative Shortest Paths in Spatial Networks
ACM Transactions on Database Systems (TODS)
Crowdsourcing computing resources for shortest-path computation
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Shortest path and distance queries on road networks: towards bridging theory and practice
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Outsourcing shortest distance computing with privacy protection
The VLDB Journal — The International Journal on Very Large Data Bases
G-tree: an efficient index for KNN search on road networks
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Shortest path finder with light materialized path view for location based services
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Energy-optimal routes for electric vehicles
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Customizable point-of-interest queries in road networks
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Best upgrade plans for large road networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Optimizing Landmark-Based Routing and Preprocessing
Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
In this paper, we have developed a \big. HiTi\bigr. (Hierarchical MulTi) graph model for structuring large topographical road maps to speed up the minimum cost route computation. The \big. HiTi\bigr. 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 \big. SPAH\bigr., which utilizes \big. HiTi\bigr. graph model of a topographical road map for its computation. We give the proof for the optimality of \big. SPAH\bigr.. Our performance analysis of \big. SPAH\bigr. 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 \big. HiTi\bigr. graph framework, we also propose a parallel shortest path algorithm named \big. ISPAH\bigr.. Experimental results show that inter query shortest path problem provides more opportunity for scalable parallelism than the intra query shortest path problem.