A Serialization Graph Construction for Nested Transactions
Summary: Provides a serialization-graph proof technique for nested transactions enabling classical-style reasoning while proving the robust “user view” correctness. Applies it to verify Moss’s nested read/write-lock algorithm and a new undo-logging scheme, while making implicit classical-theory assumptions explicit. (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. Alan Fekete
- 2. Nancy Lynch
- 3. William E. Weihl
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 4 of 4 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,589 | Transaction Synchronisation In Object Bases | 1988 | PODS | 0.00011231186 |
| 3,290 | The Impact of Recovery on Concurrency Control | 1989 | PODS | 7.2633112e-05 |
| 5,958 | Nested Transactions and Read/Write Locking (Preliminary Report) | 1987 | PODS | 5.2515466e-05 |
| 9,629 | A Theory of Timestamp-Based Concurrency Control for Nested Transactions | 1988 | VLDB | 4.3099004e-05 |
Previous
Page 1 / 1
Next