Heuristic search in database systems
Proceedings from the first international workshop on Expert database systems
Introduction to algorithms
Direct transitive closure algorithms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
Transitive closure algorithms based on graph traversal
ACM Transactions on Database Systems (TODS)
HiTi Graph Model of Topographical Roadmaps in Navigation Systems
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
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
Distance indexing on road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
Proximity queries in large traffic networks
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
The geometry of graphs and some of its algorithmic applications
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Generalizing the optimality of multi-step k-nearest neighbor query processing
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Acceleration of shortest path and constrained shortest path computation
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Techniques for Efficiently Searching in Spatial, Temporal, Spatio-temporal, and Multimedia Databases
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Querying shortest path distance with bounded errors in large graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
A safe-exit approach for efficient network-based moving range queries
Data & Knowledge Engineering
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
Best upgrade plans for large road networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Simple, fast, and scalable reachability oracle
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
We present a novel graph embedding to speed-up distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph that is applicable also for very large networks. Our method extends an existing embedding called reference node embedding which can be used to compute accurate lower and upper bounding filters for the true shortest path distance. In order to solve the problem of high storage cost for the network embedding, we propose a novel concept called hierarchical embedding that scales well to very large traffic networks. Our experimental evaluation on several real-world data sets demonstrates the benefits of our proposed concepts, i.e. efficient query processing and reduced storage cost, over existing work.