DBScholar

Back to papers

Relative Serializability: An Approach for Relaxing the Atomicity of Transactions

Summary: Relative Serializability: exploit transaction semantics to allow non-serializable but consistency-preserving interleavings via alternate atomicity views, increasing concurrency. Provide a domain-agnostic graph criterion (acyclic iff correct) that efficiently recognizes permissive schedules and subsumes prior semantic methods. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1024
Venue
PODS
Year
1994
Pagerank
5.093636e-05
Overall Rank
13,021 | 10.67%
DOI
10.1145/182591.182607

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{agrawal_pods94,
        address = {New York, NY, USA},
        series = {{PODS} '94},
        title = {{Relative Serializability: An Approach for Relaxing the Atomicity of Transactions}},
        url = {https://dl.acm.org/doi/10.1145/182591.182607},
        doi = {10.1145/182591.182607},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Agrawal, D. and Bruno, J. L. and Abbadi, A. El and Krishnaswamy, V.},
        year = {1994}
}

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 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
3,654 Simple Rational Guidance for Chopping Up Transactions 1992 SIGMOD 7.2235482e-05
Previous Page 1 / 1 Next

Semantically Similar Papers