DBScholar

Back to papers

On Totally Ordering Checkpoints In Distributed Data Bases

Summary: Proposes a cold-restart solution for distributed DBs with low-communication and partial cooperation among transaction managers during normal operation. Maintains a globally uniform total order of local checkpoints, continuously available to speed restarts and allow some nodes to skip log parsing when needed. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2244
Venue
SIGMOD
Year
1982
Pagerank
5.7303405e-05
Overall Rank
6,990 | 52.05%
DOI
10.1145/582353.582384

Incoming Non-self Citations Over Time

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.582384},
        url = {https://dl.acm.org/doi/10.1145/582353.582384},
        year = {1982}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
13,118 A Novel Checkpointing Scheme for Distributed Database Systems 1990 PODS 5.093636e-05
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