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)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. D. Agrawal
- 2. J. L. Bruno
- 3. A. El Abbadi
- 4. V. Krishnaswamy
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 |
|---|---|---|---|---|
| 2,935 | Simple Rational Guidance for Chopping Up Transactions | 1992 | SIGMOD | 7.8583979e-05 |
Previous
Page 1 / 1
Next