42 search results - page 1 / 9 » TEDI: efficient shortest path query answering on graphs |
SIGMOD
2010
ACM
13 years 5 months ago
2010
ACM
ICDE
2008
IEEE
14 years 6 months ago
2008
IEEE
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
VLDB
2012
ACM
12 years 18 days ago
2012
ACM
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
FAW
2008
Springer
13 years 6 months ago
2008
Springer
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...