DBScholar

Back to papers

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)

Paper ID
hd5b40a954ef028b1
Venue
PODS
Year
1990
Pagerank
4.9793485e-05
Overall Rank
13,405 | 9.88%
DOI
10.1145/298514.298547

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{fekete_pods90,
        address = {New York, NY, USA},
        series = {{PODS} '90},
        title = {{A Serialization Graph Construction for Nested Transactions}},
        url = {https://dl.acm.org/doi/10.1145/298514.298547},
        doi = {10.1145/298514.298547},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Fekete, Alan and Lynch, Nancy and Weihl, William E.},
        year = {1990}
}

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
2,132 Transaction Synchronisation In Object Bases 1988 PODS 8.9925975e-05
3,591 The Impact of Recovery on Concurrency Control 1989 PODS 7.1861436e-05
7,235 Nested Transactions and Read/Write Locking (Preliminary Report) 1987 PODS 5.5790582e-05
9,939 A Theory of Timestamp-Based Concurrency Control for Nested Transactions 1988 VLDB 5.1065302e-05
Previous Page 1 / 1 Next

Semantically Similar Papers