SCARAB: scaling reachability computation on large graphs

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 increasingly large, scalability is quickly becoming the major research challenge for the reachability computation today. Can we construct indices which scale to graphs with tens of millions of vertices and edges? Can the existing reachability indices which perform well on moderate-size graphs be scaled to very large graphs? In this paper, we propose SCARAB (standing for SCAlable ReachABility), a unified reachability computation framework: it not only can scale the existing state-of-the-art reachability indices, which otherwise could only be constructed and work on moderate size graphs, but also can help speed up the online query answering approaches. Our experimental results demonstrate that SCARAB can perform on graphs with millions of vertices/edges and is also much faster then GRAIL, the state-of-the-art sca...

• Type: Journal
• Year: 2012
• Where: SIGMOD
• Authors: Ruoming Jin, Ning Ruan, Saikat Dey, Jeffrey Xu Yu
• Keywords: Computation Framework, Database, Reachability, Research Challenge, SIGMOD 2012