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)
Incoming Non-self Citations Over Time
Authors
- 1. Rong Sun
- 2. Gomer Thomas
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,621 | Serialization Graph Algorithms for Multiversion Concurrency Control | 1988 | PODS | 0.00011109354 |
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,144 | A Mean Value Performance Model for Locking in Databases: The Waiting Case | 1984 | PODS | 0.00013698131 |
| 1,563 | Basic Timestamp, Multiple Version Timestamp, and Two-Phase Locking | 1983 | VLDB | 0.00011352203 |
| 2,950 | The Performance Of Concurrency Control Algorithms For Database Management Systems | 1984 | VLDB | 7.8329866e-05 |
| 6,808 | Obtaining Progressive Protocols for a Simple Multiversion Database Model | 1983 | VLDB | 4.9217773e-05 |
Previous
Page 1 / 1
Next