Sciweavers

87 search results - page 1 / 18
» Optimization and evaluation of shortest path queries
Sort
View
VLDB
2007
ACM
114views Database» more  VLDB 2007»
14 years 3 months ago
Optimization and evaluation of shortest path queries
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 shortes...
Edward P. F. Chan, Heechul Lim
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
13 years 5 months ago
Visiting a Polygon on the Optimal Way to a Query Point
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
Ramtin Khosravi, Mohammad Ghodsi
SSD
2005
Springer
153views Database» more  SSD 2005»
13 years 9 months ago
Constrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...
PVLDB
2010
146views more  PVLDB 2010»
13 years 2 months ago
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
Michael Rice, Vassilis J. Tsotras
ISAAC
2005
Springer
118views Algorithms» more  ISAAC 2005»
13 years 9 months ago
External Data Structures for Shortest Path Queries on Planar Digraphs
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
Lars Arge, Laura Toma