Towards A Theory Of Online Schedulers
Summary: Develops a modular theory of online transaction schedulers with built-in deadlock/livelock prevention (restarts) and a simple, realistic metric for comparison. Compares schedulers via cross-log user-delay bounds and lower-bound examples, finding no order-of-magnitude gaps. (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. Kari-Jouko Räihä
- 2. Henry Tirri
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 2 of 2 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,362 | A Sophisticate's Introduction to Distributed Database Concurrency Control | 1982 | VLDB | 0.00011129257 |
| 1,381 | Queueing Network Models for Concurrent Transaction Processing in a Database System | 1979 | SIGMOD | 0.00011063587 |
Previous
Page 1 / 1
Next