Database Paper Browser

Back to papers

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)

Paper ID
11156
Venue
VLDB
Year
2015
Pagerank
4.8246382e-05
Overall Rank
7,125 | 50.44%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers