DBScholar

Back to papers

SCARAB: Scaling Reachability Computation on Large Graphs

Summary: SCARAB: scalable reachability framework for graphs with tens of millions of vertices/edges. Unified approach to scale state-of-the-art indices and speed up online queries; demonstrates orders-of-magnitude improvement over GRAIL on large-scale graphs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4583
Venue
SIGMOD
Year
2012
Pagerank
7.8401031e-05
Overall Rank
3,021 | 79.28%
DOI
10.1145/2213836.2213856

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{jin_sigmod12,
        title = {{SCARAB: Scaling Reachability Computation on Large Graphs}},
        author = {Jin, Ruoming and Ruan, Ning and Dey, Saikat and Xu, Jeffrey Yu},
        series = {{SIGMOD} '12},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2213836.2213856},
        url = {https://dl.acm.org/doi/10.1145/2213836.2213856},
        year = {2012}
}

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers