Summary
An interleaved execution of transactions in a database system is serializable if the effect of the execution is equivalent to that of some serial execution of the transactions. Several notions of serializability have been defined in the literature. They differ with respect to whether the effect is equivalent regarding the values read by the transactions or the final database state, that is, the values read by the fictitious final transaction. We introduce a generalized notion called S-serializability, where the subset S of transactions read the same values as in some serial execution. We also introduce C-serializability where the final values for the subset C of data items are the same as in some serial execution. By combining these two notions, we get (S + C)-serializability. We give simple and intuitive characterizations for all these notions of serializability.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bernstein, P.A., Shipman, D.W., Wong, W.S.: Formal Aspects of Serializability in Database Concurrency Control. IEEE Trans. Software Eng. SE-5 3, 203–215 (1979)
Brzozowski, J.A.: On Models of Transactions. Technical Report No. 84001, Department of Applied Mathematics and Physics, Kyoto University, Japan 1984
Brzozowski, J.A., Muro, S.: On Serializability. Technical Report No. 84012, Department of Applied Mathematics and Physics, Kyoto University, Japan 1984
Ibaraki, T., Kameda, T., Minoura, T.: Disjoint-interval Topological Sort: A Useful Concept in Serializability Theory. Proc. 9th Int. Conf. on VLDB. pp. 89–91, Florence, Italy 1983
Kung, H.T., Papadimitriou, C.H.: an Optimality Theory of Concurrency Control for Databases. Acta Inf. 19, 1–11 (1983)
Papadimitriou, C.H.: The Serializability of Concurrent Database Updates. J. ACM 26, 631–653 (1979)
Vidyasankar, K.: A Simple Characterization of Database Serializability. Foundations of Software Technology and Theoretical Computer Science, Fifth Conference, New Delhi, India. Lect. Notes Comput. Sci. Vol. 206. pp. 329–345. Berlin, Heidelberg, New York: Springer 1985
Vidyasankar, K., Younger, D.H.: A Minimax Equality Related to the Longest Directed Path in an Acyclic Graph. Can. J. Math. 27, 348–351 (1975)
Yannakakis, M.: Serializability by Locking. J. ACM 31, 227–244 (1984)
Author information
Authors and Affiliations
Additional information
This research is supported in part by the Natural Sciences and Engineering Research Council of Canada Individual Operating Grant A-3182
Rights and permissions
About this article
Cite this article
Vidyasankar, K. Generalized theory of serializability. Acta Informatica 24, 105–119 (1987). https://doi.org/10.1007/BF00290709
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00290709