DBScholar

Back to papers

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
781
Venue
PODS
Year
1987
Pagerank
5.7054872e-05
Overall Rank
7,095 | 51.33%
DOI
10.1145/28659.28669

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{fekete_pods87,
        address = {New York, NY, USA},
        series = {{PODS} '87},
        title = {{Nested Transactions and Read/Write Locking (Preliminary Report)}},
        url = {https://dl.acm.org/doi/10.1145/28659.28669},
        doi = {10.1145/28659.28669},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Fekete, Alan and Lynch, Nancy and Merritt, Michael and Weihl, William},
        year = {1987}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
2,450 Formal Model of Correctness Without Serializability 1988 SIGMOD 8.565918e-05
13,115 A Serialization Graph Construction for Nested Transactions 1990 PODS 5.093636e-05
Previous Page 1 / 1 Next

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
Previous Page 1 / 1 Next

Semantically Similar Papers