The Serializability of Concurrent Database Updates¶
Papadimitriou, C. H. (1979). The Serializability of Concurrent Database Updates. ACM, 26(4), 631-653.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Concurrency Serialization Gate
- Pin the uniqueness criterion. Define the invariant that must hold after the transition (stock never negative; balance conserved) so that of the many interleavings the hardware might attempt, only outcomes equivalent to a serial run are accepted — a serializability guarantee.
This sourceDefines serializability as accepting concurrent transaction histories whose effect is equivalent to some sequential execution.
- Pin the uniqueness criterion. Define the invariant that must hold after the transition (stock never negative; balance conserved) so that of the many interleavings the hardware might attempt, only outcomes equivalent to a serial run are accepted — a serializability guarantee.
- Order-Insensitive Batch Processing
- Its strength is operational: a batch designed this way can be parallelized, retried, and load-balanced with almost no coordination, and timing-caused failures become easier to isolate because the allowed orders are made explicit.
This sourceFormalizes serializability by identifying concurrent executions that are equivalent to an allowed serial ordering.
- Its strength is operational: a batch designed this way can be parallelized, retried, and load-balanced with almost no coordination, and timing-caused failures become easier to isolate because the allowed orders are made explicit.
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? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.
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:e9dd65c5ef80 · see in the full table