Database Paper Browser

Back to papers

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)

Paper ID
713
Venue
PODS
Year
1984
Pagerank
4.1945683e-05
Overall Rank
13,035 | 9.32%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers