85 search results - page 2 / 17 » Fast and practical indexing and querying of very large graph... |
ESA
2010
Springer
13 years 6 months ago
2010
Springer
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
DASFAA
2009
IEEE
13 years 9 months ago
2009
IEEE
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
EDBT
2002
ACM
14 years 5 months ago
2002
ACM
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
EDBT
2009
ACM
13 years 10 months ago
2009
ACM
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
PVLDB
2010
13 years 3 months ago
2010
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...