DBScholar

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
990
Venue
PODS
Year
1993
Pagerank
5.302893e-05
Overall Rank
9,134 | 37.55%
DOI
10.1145/153850.153859

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{rastogi_pods93,
        address = {New York, NY, USA},
        series = {{PODS} '93},
        title = {{On Correctness of Non-serializable Executions}},
        url = {https://dl.acm.org/doi/10.1145/153850.153859},
        doi = {10.1145/153850.153859},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Rastogi, Rajeev and Mehrotra, Sharad and Breitbart, Yuri and Korth, Henry F. and Silberschatz, Avi},
        year = {1993}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
12,961 Exploiting Versions for Handling Updates in Broadcast Disks 1999 VLDB 5.0723324e-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
65 Sagas 1987 SIGMOD 0.00038600275
3,795 Extracting Concurrency from Objects: A Methodology 1991 SIGMOD 7.1074024e-05
Previous Page 1 / 1 Next

Semantically Similar Papers