23 search results - page 1 / 5 » Efficiently answering reachability queries on very large dir... |
SIGMOD
2008
ACM
14 years 5 months ago
2008
ACM
RP
2010
Springer
13 years 2 months ago
2010
Springer
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
EDBT
2006
ACM
14 years 5 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...
CIKM
2010
Springer
13 years 3 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
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...