200 search results - page 1 / 40 » Fast Computation of Reachability Labeling for Large Graphs |
EDBT
2006
ACM
14 years 4 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
EDBT
2008
ACM
14 years 4 months ago
2008
ACM
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
Graph reachability is fundamental to a wide range of applications, including XML indexing, geographic navigation, Internet routing, ontology queries based on RDF/OWL, etc. Many ap...
SIGMOD
2012
ACM
11 years 7 months ago
2012
ACM
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
DASFAA
2009
IEEE
13 years 8 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...