Abstract
In this paper, we have addressed an open problem posed by [SWY93]: how to characterize the class of histories PRED in a constructive way so that unified scheduling protocols can be derived from it. We have slightly modified the original definitions of expanded histories and PRED to account for certain executions, and we have provided an equivalent class, SOT, with a more constructive definition. This new class is used as the basis for several protocols that implement unified concurrency control and recovery in an efficient manner.
So far, our model is restricted to read and write operations. However, both the model and the developed protocols can be generalized to transactions with semantically rich operations where recovery is based on compensating operations.
This material is based in part upon work supported by NSF grants IRI-9221947, IRI-9012902 and IRI-9117904 and by grant from Hewlett-Packard Corporation. This work has been performed while Y. Breitbart was on one year sabbatical and R. Vingralek was visiting for 8 months the database research group at ETH, Zurich.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
D. Agrawal and A. El Abbadi. Locks with Constrained Sharing. In Proceedings of the Ninth ACM Symposium on Principles of Database Systems, pages 85–93, April 1990. To appear in Journal of Computer and System Sciences.
G. Alonso, D. Agrawal, A. El Abbadi. A Unified Implementation of Concurrency Control and Recovery. Technical Report, Department of Computer Science, University of California at Santa Barbara, TRCS93-19, October 1993
G. Alonso, R. Vingralek, D. Agrawal, Y. Breitbart, A. El Abbadi, H. Schek, and G. Weikum. Unifying concurrency control and recovery of transactions. Information Systems, 1994. to appear in the special EDBT'94 issue.
C. Beeri, P. A. Bernstein, and N. Goodman. A Model for Concurrency in Nested Transactions Systems. Journal of the ACM, 36(2):230–269, April 1989.
Y. Breitbart, D. Georgakopoulos, M. Rusinkiewisz, and A. Silberschatz. On rigorous transaction scheduling. IEEE Transaction on Software Engineering, 17(9), 1991.
P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency control and recovery in database systems. Addison-Wesley, 1987.
P. A. Bernstein, D. W. Shipman, and W. S. Wong. Formal Aspects of Serializability in Database Concurrency Control. IEEE Transactions on Software Engineering, 5(5):203–216, May 1979.
J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, 1993.
T. Härder and A. Reuter. Principles of Transaction-Oriented Database Recovery. ACM Computing Surveys, 15(4):287–317, December 1983.
H. J. Schek, G. Weikum, and H. Ye. Towards a Unified Theory of Concurrency Control and Recovery. In Proceedings of the ACM Symposium on Principles of Database Systems, pages 300–311, June 1993.
R. Vingralek, Y. Breitbart, H.-J. Schek, G. Weikum. Concurrency Control Protocols Guaranteeing Atomicity and Serializability. Technical Report 199, Department of Computer Science, ETH Zurich, July 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alonso, G. et al. (1994). A unified approach to concurrency control and transaction recovery. In: Jarke, M., Bubenko, J., Jeffery, K. (eds) Advances in Database Technology — EDBT '94. EDBT 1994. Lecture Notes in Computer Science, vol 779. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57818-8_46
Download citation
DOI: https://doi.org/10.1007/3-540-57818-8_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57818-5
Online ISBN: 978-3-540-48342-7
eBook Packages: Springer Book Archive