Start Late or Finish Early: A Distributed Graph Processing System with Redundancy Reduction

Summary: SLFE identifies pervasive redundancy in distributed vertex-centric graph processing and uses lightweight topological preprocessing to “start late or finish early.” Its redundancy-aware model preserves parallelism, achieving up to 75× speedups over distributed systems and 1644× over shared-memory systems. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 12034
Venue: VLDB
Year: 2019
Pagerank: 5.4907964e-05
Overall Rank: 8,085 | 44.54%
DOI: 10.14778/3282495.3282501

Incoming Non-self Citations Over Time

Authors

1. Shuang Song (University of Texas)
2. Xu Liu (College of William and Mary)
3. Qinzhe Wu (University of Texas)
4. Andreas Gerstlauer (University of Texas)
5. Tao Li (University of Florida)
6. Lizy K. John (University of Texas)

BibTeX Citation

@article{song_vldb19,
        title = {{Start Late or Finish Early: A Distributed Graph Processing System with Redundancy Reduction}},
        author = {Song, Shuang and Liu, Xu and Wu, Qinzhe and Gerstlauer, Andreas and Li, Tao and John, Lizy K.},
        journal = {PVLDB},
        series = {{VLDB} '19},
        volume = {12},
        number = {2},
        pages = {154--168},
        doi = {10.14778/3282495.3282501},
        url = {https://doi.org/10.14778/3282495.3282501},
        year = {2019}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
6,857	RAGraph: A Region-Aware Framework for Geo-Distributed Graph Processing	2024	VLDB	5.7525746e-05
8,873	TGraph: A Tensor-centric Graph Processing Framework	2025	SIGMOD	5.3539725e-05

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
3	Pregel: A System for Large-Scale Graph Processing	2010	SIGMOD	0.0012250108
20	Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud	2012	VLDB	0.00056944564
389	One Trillion Edges: Graph Processing at Facebook-Scale	2015	VLDB	0.00019386526
436	Trinity: A Distributed Graph Engine on a Memory Cloud	2013	SIGMOD	0.00018504439
1,865	An Experimental Comparison of Partitioning Strategies in Distributed Graph Processing	2017	VLDB	9.5915721e-05
1,875	Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation	2015	VLDB	9.5728308e-05
1,966	GraphMat: High performance graph analytics made productive	2015	VLDB	9.3844743e-05
2,325	Giraph Unchained: Barrierless Asynchronous Parallel Execution in Pregel-like Graph Processing Systems	2015	VLDB	8.7495171e-05
4,297	Graph Analytics Through Fine-Grained Parallelism	2016	SIGMOD	6.7770261e-05
7,610	Using Domain-Specific Languages For Analytic Graph Databases	2016	VLDB	5.5838483e-05
9,218	GraphTwist: Fast Iterative Graph Computation with Two-tier Optimizations	2015	VLDB	5.3048204e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	1,911	Fast Iterative Graph Computation with Block Updates	2013	VLDB
2	11,892	Dynamic Scaling for Parallel Graph Computations	2019	VLDB
3	3,303	A Distributed Multi-GPU System for Fast Graph Processing	2018	VLDB
4	1,803	Towards Effective Partition Management for Large Graphs	2012	SIGMOD
5	7,218	Fast Failure Recovery in Distributed Graph Processing Systems	2015	VLDB
6	3,008	Scalable Big Graph Processing in MapReduce	2014	SIGMOD
7	1,246	Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows	2018	VLDB
8	3,109	Managing Large Dynamic Graphs Efficiently	2012	SIGMOD
9	4,787	Systems for Big-Graphs	2014	VLDB
10	1,875	Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation	2015	VLDB