Nested Transactions and Read/Write Locking (Preliminary Report)

Summary: First correctness proof of Moss's nested-transaction algorithm for concurrency control and abort recovery (not crash-tolerant), validating practical two-phase read/write locking. Adds precise read-equivalence/transparency definitions and an I/O-automata serial-correctness framework to formalize nested transactions. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 782
Venue: PODS
Year: 1987
Pagerank: 5.2564433e-05
Overall Rank: 5,957 | 58.56%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,753	Formal Model of Correctness Without Serializability	1988	SIGMOD	0.00010673887
12,920	A Serialization Graph Construction for Nested Transactions	1990	PODS	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
1,642	Transaction Synchronisation In Object Bases	1988	PODS	0.00011044566
12,887	An Approach to Eliminate Transaction Blocking in Locking Protocols	1992	PODS	4.1945683e-05
12,758	Correctness and Parallelism in Composite Systems	1997	PODS	4.1945683e-05
1,148	Abstraction in Recovery Management	1986	SIGMOD	0.00013660928
1,589	A Theoretical Foundation Of Multi-Level Concurrency Control	1986	PODS	0.00011238248
14,249	Safety Of Non-Well-Locked Transaction Systems	1986	PODS	-
9,629	A Theory of Timestamp-Based Concurrency Control for Nested Transactions	1988	VLDB	4.3139594e-05
1,243	Concurrency Control of Nested Transactions Accessing B-Trees	1989	PODS	0.00013096387
3,123	Concurrency Control for Resilient Nested Transactions	1983	PODS	7.5249489e-05
12,920	A Serialization Graph Construction for Nested Transactions	1990	PODS	4.1945683e-05