9 search results - page 1 / 2 » Variant path types for scalable extensibility |
OOPSLA
2007
Springer
13 years 11 months ago
2007
Springer
PVLDB
2010
13 years 3 months ago
2010
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...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We consider the minimum equivalent digraph (directed network) problem (also known as the strong transitive reduction) and its maximum objective function variant, with two types of...
VLDB
2007
ACM
14 years 5 months ago
2007
ACM
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...
MDM
2009
Springer
13 years 11 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...