The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
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 ...
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
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 ...
Hilmi Yildirim, Vineet Chaoji, Mohammed Javeed Zak...