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: 4522
Venue: SIGMOD
Year: 2012
Pagerank: 7.5054361e-05
Overall Rank: 3,130 | 78.25%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,776	Reachability Queries on Large Dynamic Graphs: A Total Order Approach	2014	SIGMOD	0.0001058029
1,879	TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph	2013	SIGMOD	0.00010227906
2,076	Efficient Ad-hoc Search for Personalized PageRank	2013	SIGMOD	9.6057342e-05
2,762	K-Reach: Who is in Your Small World	2012	VLDB	8.1614818e-05
3,221	Landmark Indexing for Evaluation of Label-Constrained Reachability Queries	2017	SIGMOD	7.3541078e-05
3,676	Simple, Fast, and Scalable Reachability Oracle	2013	VLDB	6.8500097e-05
4,478	Reachability Querying: An Independent Permutation Labeling Approach	2014	VLDB	6.1452192e-05
6,796	Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond	2020	VLDB	4.9195203e-05
7,595	DAG Reduction: Fast Answering Reachability Queries	2017	SIGMOD	4.6980168e-05
7,903	Coarsening Massive Influence Networks for Scalable Diffusion Analysis	2017	SIGMOD	4.6170606e-05
9,485	I/O Efficient Label-Constrained Reachability Queries in Large Graphs	2024	VLDB	4.3300131e-05
9,897	Top-k Relevant Semantic Place Retrieval on Spatial RDF Data	2016	SIGMOD	4.2559233e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
255	Efficient Management of Transitive Relationships in Large Data and Knowledge Bases	1989	SIGMOD	0.00030342925
280	3-HOP: A High-Compression Indexing Scheme for Reachability Query	2009	SIGMOD	0.00029092277
334	Fast and Practical Indexing and Querying of Very Large Graphs	2007	SIGMOD	0.00027077424
425	Stack-based Algorithms for Pattern Matching on DAGs	2005	VLDB	0.00023592024
727	GRAIL: Scalable Reachability Index for Large Graphs	2010	VLDB	0.00017462279
784	Efficiently Answering Reachability Queries on Very Large Directed Graphs	2008	SIGMOD	0.00016648392
1,551	A Memory Efficient Reachability Data Structure Through Bit Vector Compression	2011	SIGMOD	0.00011395294

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
3,676	Simple, Fast, and Scalable Reachability Oracle	2013	VLDB	6.8500097e-05
2,958	Computing Label-Constraint Reachability in Graph Databases	2010	SIGMOD	7.8126329e-05
8,667	Distributed Set Reachability	2016	SIGMOD	4.467539e-05
334	Fast and Practical Indexing and Querying of Very Large Graphs	2007	SIGMOD	0.00027077424
6,796	Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond	2020	VLDB	4.9195203e-05
9,485	I/O Efficient Label-Constrained Reachability Queries in Large Graphs	2024	VLDB	4.3300131e-05
1,776	Reachability Queries on Large Dynamic Graphs: A Total Order Approach	2014	SIGMOD	0.0001058029
784	Efficiently Answering Reachability Queries on Very Large Directed Graphs	2008	SIGMOD	0.00016648392
5,431	SCARA: Scalable Graph Neural Networks with Feature-Oriented Optimization	2022	VLDB	5.5104776e-05
727	GRAIL: Scalable Reachability Index for Large Graphs	2010	VLDB	0.00017462279