An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Introduction to algorithms
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
Finding shortest paths in large network systems
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Algorithms for Searching Massive Graphs
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and 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 Spatiotemporal Model and Language for Moving Objects on Road Networks
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
An external memory data structure for shortest path queries (extended abstract)
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
A fast unified optimal route query evaluation algorithm
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Distance-join: pattern match query in a large graph database
Proceedings of the VLDB Endowment
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
Graph pattern matching: from intractable to polynomial time
Proceedings of the VLDB Endowment
BMC: an efficient method to evaluate probabilistic reachability queries
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Subgraph search over massive disk resident graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Top-K possible shortest path query over a large uncertain graph
WISE'11 Proceedings of the 12th international conference on Web information system engineering
Dynamic skyline queries in large graphs
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Fast and exact top-k search for random walk with restart
Proceedings of the VLDB Endowment
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
Graph pattern matching revised for social network analysis
Proceedings of the 15th International Conference on Database Theory
Using the ACO algorithm for path searches in social networks
Applied Intelligence
A similarity measure for approximate querying over RDF data
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Incremental graph pattern matching
ACM Transactions on Database Systems (TODS)
Efficient simrank-based similarity join over large graphs
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortest path query efficiently, we introduce two pruning algorithms. These algorithms differ on the extent of materialization of shortest path cost and on how the search space is pruned. By grouping shortest path queries properly, batch processing improves the performance of shortest path query evaluation. Extensive study is also done on fragment sizes, cache sizes and query types that we show that affect the performance of a disk-based shortest path algorithm. The performance and scalability of proposed techniques are evaluated with large road systems in the Eastern United States. To demonstrate that the proposed disk-based algorithms are viable, we show that their search times are significant better than that of main-memory Dijkstra's algorithm.