Database Paper Browser

Back to papers

On Correctness of Non-serializable Executions

Summary: Argues strict serializability is impractical for long-duration/distributed transactions and surveys alternatives—operation semantics, sagas, commutativity, partitioning—to raise concurrency. Develops formal models and verifiable conditions to deem non-serializable executions correct for distributed/interactive DBs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
991
Venue
PODS
Year
1993
Pagerank
4.427232e-05
Overall Rank
8,941 | 37.80%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
12,715 Exploiting Versions for Handling Updates in Broadcast Disks 1999 VLDB 4.1945683e-05
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
45 Sagas 1987 SIGMOD 0.00071800944
3,533 Extracting Concurrency from Objects: A Methodology 1991 SIGMOD 7.0009039e-05
Previous Page 1 / 1 Next

Semantically Similar Papers