Fast Failure Recovery in Distributed Graph Processing Systems
Summary: Proposes a partitioned, cost-aware recovery for distributed graph processing that parallelizes repair across remaining nodes after a failure. Augments checkpoint- and log-based schemes with a graph-partitioning mechanism, achieving up to 30x faster recovery on Giraph (40-node cluster). (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yanyan Shen (National University of Singapore)
- 2. Gang Chen (Zhejiang University)
- 3. H. V. Jagadish (University of Michigan)
- 4. Wei Lu (Renmin University)
- 5. Beng Chin Ooi (National University of Singapore)
- 6. Bogdan Marius Tudor (National University of Singapore)
BibTeX Citation
@article{shen_vldb15,
title = {{Fast Failure Recovery in Distributed Graph Processing Systems}},
author = {Shen, Yanyan and Chen, Gang and Jagadish, H. V. and Lu, Wei and Ooi, Beng Chin and Tudor, Bogdan Marius},
journal = {PVLDB},
series = {{VLDB} '15},
volume = {8},
number = {4},
pages = {437--448},
doi = {10.14778/2735508.2735512},
url = {https://doi.org/10.14778/2735508.2735512},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,078 | Asynchronous and Fault-Tolerant Recursive Datalog Evaluation in Shared-Nothing Engines | 2015 | VLDB | 6.9209348e-05 |
| 8,869 | A Distributed System for Large-scale n-gram Language Models at Tencent | 2019 | VLDB | 5.3543688e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 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 |
| 436 | Trinity: A Distributed Graph Engine on a Memory Cloud | 2013 | SIGMOD | 0.00018504439 |
| 2,137 | Efficient Processing of k Nearest Neighbor Joins using MapReduce | 2012 | VLDB | 9.110238e-05 |
| 2,354 | epiC: an Extensible and Scalable System for Processing Big Data | 2014 | VLDB | 8.7060612e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,085 | Start Late or Finish Early: A Distributed Graph Processing System with Redundancy Reduction | 2019 | VLDB |
| 2 | 3,008 | Scalable Big Graph Processing in MapReduce | 2014 | SIGMOD |
| 3 | 2,221 | Streaming Graph Partitioning: An Experimental Study | 2018 | VLDB |
| 4 | 7,362 | A Study of Partitioning Policies for Graph Analytics on Large-scale Distributed Platforms | 2019 | VLDB |
| 5 | 1,246 | Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows | 2018 | VLDB |
| 6 | 1,865 | An Experimental Comparison of Partitioning Strategies in Distributed Graph Processing | 2017 | VLDB |
| 7 | 4,787 | Systems for Big-Graphs | 2014 | VLDB |
| 8 | 9,596 | Cost-based Fault-tolerance for Parallel Data Processing | 2015 | SIGMOD |
| 9 | 1,875 | Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation | 2015 | VLDB |
| 10 | 3,109 | Managing Large Dynamic Graphs Efficiently | 2012 | SIGMOD |