A Novel Checkpointing Scheme for Distributed Database Systems
Summary: Non-blocking checkpointing for distributed DBs that records states of selected data items using per-item "shadows" to produce transaction-consistent snapshots without halting normal activity. Low storage overhead (≤1 shadow/item) and on-demand execution. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Slawomir Pilarski
- 2. Tiko Kameda
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 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,581 | On-the-Fly, Incremental, Consistent Reading of Entire Databases | 1985 | VLDB | 8.5019381e-05 |
| 6,034 | On Totally Ordering Checkpoints In Distributed Data Bases | 1982 | SIGMOD | 5.2415551e-05 |
Previous
Page 1 / 1
Next