DBScholar

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
2261
Venue
SIGMOD
Year
1982
Pagerank
-
Overall Rank
14,536 | 0.27%
DOI
10.1145/582353.582408

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{kuss_sigmod82,
        title = {{ON TOTALLY ORDERING CHECKPOINTS IN DISTRIBUTED DATA BASES}},
        author = {Kuss, Herbert},
        series = {{SIGMOD} '82},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/582353.582408},
        url = {https://dl.acm.org/doi/10.1145/582353.582408},
        year = {1982}
}

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