Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Reachability and Distance Queries via 2-Hop Labels
SIAM Journal on Computing
Journal of Algorithms
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An efficient and scalable approach to CNN queries in a road network
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Efficient query processing on spatial networks
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Engineering highway hierarchies
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A Practical Shortest Path Algorithm with Linear Expected Time
SIAM Journal on Computing
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Monitoring path nearest neighbor in road networks
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Path oracles for spatial networks
Proceedings of the VLDB Endowment
Query Processing Using Distance Oracles for Spatial Networks
IEEE Transactions on Knowledge and Data Engineering
Highway dimension, shortest paths, and provably efficient algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A hub-based labeling algorithm for shortest paths in road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
PHAST: Hardware-Accelerated Shortest Path Trees
IPDPS '11 Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium
Relational approach for shortest path discovery over large graphs
Proceedings of the VLDB Endowment
Exact Routing in Large Road Networks Using Contraction Hierarchies
Transportation Science
Hierarchical hub labelings for shortest paths
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths
Proceedings of the first ACM conference on Online social networks
Call me maybe: understanding nature and risks of sharing mobile numbers on online social networks
Proceedings of the first ACM conference on Online social networks
Customizable point-of-interest queries in road networks
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
This paper introduces HLDB, the first practical system that can answer exact spatial queries on continental road networks entirely within a database. HLDB is based on hub labels (HL), the fastest point-to-point algorithm for road networks, and its queries are implemented (quite naturally) in standard SQL. Within the database, HLDB answers exact distance queries and retrieves full shortest-path descriptions in real time, even on networks with tens of millions of vertices. The basic algorithm can be extended in a natural way (still in SQL) to answer much more sophisticated queries, such as finding the ten closest fast-food restaurants. We also introduce efficient new HL-based algorithms for even harder problems, such as best via point, ride sharing, and point of interest prediction. The HLDB framework makes it easy to implement these algorithms in SQL, enabling interactive applications on continental road networks.