Database Paper Browser

Back to papers

On Totally Ordering Checkpoints In Distributed Data Bases

Summary: Totally ordered checkpoints for distributed DBs to speed cold restart with low communications and partial manager cooperation. A globally maintained total order of local checkpoints enables fast restart and lets some nodes decide in advance to skip log parsing, unlike prior approaches. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2199
Venue
SIGMOD
Year
1982
Pagerank
-
Overall Rank
14,335 | 0.28%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers