Database Paper Browser

Back to papers

Using Formal Methods To Reason About Semantics-Based Decompositions Of Transactions

Summary: Formal methods for semantics-based transaction decomposition; semantic histories yield proof obligations that ensure the decomposition faithfully models the original workload. Impact on atomicity, isolation, and consistency; presents a controlled technique to surrender these properties with formal guarantees. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8271
Venue
VLDB
Year
1995
Pagerank
4.1905499e-05
Overall Rank
12,822 | 10.89%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

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

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

Rank Cited Paper Year Venue Pagerank
1,216 Quasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase 1989 VLDB 0.00013240322
1,753 Formal Model of Correctness Without Serializability 1988 SIGMOD 0.00010665163
2,938 Simple Rational Guidance for Chopping Up Transactions 1992 SIGMOD 7.8516541e-05
Previous Page 1 / 1 Next

Semantically Similar Papers