DBScholar

Back to papers

Performance Results on Multiversion Timestamp Concurrency Control with Predeclared Writesets

Summary: Simulations show Basic TO and MVTO collapse in throughput when even a tiny fraction of jobs are long-update transactions. The Buckley–Silberschatz multiversion protocol using predeclared writesets eliminates rollbacks, avoids thrashing, outperforms 2PL, and has a strong optimality theorem. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
790
Venue
PODS
Year
1987
Pagerank
5.7828658e-05
Overall Rank
6,757 | 53.65%
DOI
10.1145/28659.28678

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{sun_pods87,
        address = {New York, NY, USA},
        series = {{PODS} '87},
        title = {{Performance Results on Multiversion Timestamp Concurrency Control with Predeclared Writesets}},
        url = {https://dl.acm.org/doi/10.1145/28659.28678},
        doi = {10.1145/28659.28678},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Sun, Rong and Thomas, Gomer},
        year = {1987}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
2,675 Serialization Graph Algorithms for Multiversion Concurrency Control 1988 PODS 8.2707581e-05
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.

Previous Page 1 / 1 Next

Semantically Similar Papers