THEORY OF SERIALIZABILITY FOR A PARALLEL MODEL OF TRANSACTIONS (Extended Abstract)
Summary: Generalizes serializability from the sequential two-step model to a parallel multi-step program-schema, defining two classes of serializable executions and extending recognition and online-scheduling results to the parallel setting. Argues online scheduling is unsuitable, introduces batch schedulers and minimal precedence constraints, and proves any optimal batch scheduler that relies only on syntactic information cannot be efficient. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,928 | Foundations of Data-Aware Process Analysis: A Database Theory Perspective | 2013 | PODS | 0.00010061483 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 347 | An Optimality Theory of Concurrency Control for Databases | 1979 | SIGMOD | 0.00026610677 |
Previous
Page 1 / 1
Next