Notes on Data Base Operating Systems¶
Gray, J. (1978). Notes on Data Base Operating Systems. Operating Systems: An Advanced Course.
Cited by¶
4 citations across 4 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Common Ground
- Two generals on opposite hills must attack a city in the valley between them at the same time; attacking alone is a defeat, and they can communicate only by sending messengers who may be captured crossing the valley.
This sourceIntroduces the two-generals / coordinated-attack problem in the context of database commit, showing perfect agreement over a lossy channel is impossible.
- Two generals on opposite hills must attack a city in the valley between them at the same time; attacking alone is a defeat, and they can communicate only by sending messengers who may be captured crossing the valley.
- Deadlock
- A database system deadlocking on circular lock acquisition, two departments in a company each waiting for the other's deliverable, and two negotiators in talks each refusing to move without the other's concession embody the same structural problem: circular dependencies trap all parties
This sourceFoundational treatment of database transaction management, including lock-based concurrency control and deadlock detection via wait-for graphs with victim abort/retry.
Supported in partVerified against the publisher's abstract
Gray's chapter is a database-systems source on transaction management, locking and recovery; it covers the database leg of the analogy, not the claim that circular dependencies trap parties in all three domains.
“After a brief overview of what a data management system is it focuses on particular issues unique to the transaction management component especially locking and recovery.”
- A database system deadlocking on circular lock acquisition, two departments in a company each waiting for the other's deliverable, and two negotiators in talks each refusing to move without the other's concession embody the same structural problem: circular dependencies trap all parties
Mechanisms¶
- Identifier Reservation Queue
- The reserve-then-commit shape mirrors two-phase commit, where a resource is first prepared and only later made final.
This sourceDescribes two-phase commit as preparing resources first and making the transaction final only in the later commit phase.
- The reserve-then-commit shape mirrors two-phase commit, where a resource is first prepared and only later made final.
- Two-Phase Commit with Freshness Check
- It is the classic distributed-transaction shape, two-phase commit, hardened with a use-time re-check.
This sourceDescribes the prepare and commit phases of two-phase commit for coordinating a distributed transaction.
- It is the classic distributed-transaction shape, two-phase commit, hardened with a use-time re-check.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 4 citations: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:1d0e7d611794 · see in the full table