Towards a Unified Theory of Concurrency Control and Recovery
|Title||Towards a Unified Theory of Concurrency Control and Recovery|
|Author(s)||H.-J. Schek, G. Weikum, H. Ye|
|Booktitle||12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)Washington, DC|
|Organization||Institute of Information Systems, ETH Zurich|
AbstractThe classical theory of transaction management is based on two different and independent criteria for the correct execution of transactions. The first criterion, serializability, ensures correct execution of parallel transactions under the assumption that no failures occur. The second criterion, strictness, ensures correct recovery from failures.
In this paper we develop a unified model that allows reasoning about the correctness of concurrency control and recovery within the same framework. We introduce the correctness criteria of (prefix-)reducibility and (prefix-)expanded serializability and investigate their relationships to the classical criteria. An important advantage of our model is that it captures schedules with semantically rich ADT actions in addition to classical read/write schedules.