Abstract
We present here a unified transaction model for database systems with semantically rich operations. Based on the work in [SWY93], we develop constructive correctness criteria that encompass both serializability and failure atomicity in a uniform manner. As it turns out, an exact characterization of the class of prefix reducible schedules that was introduced for the simple read/write model in [AVA+94] is infeasible. Thus, we propose here two subclasses of prefix reducible schedules and argue that serializability and atomicity can be unified by considering schedules from these classes. We also show that the previously proposed correctness criteria [MGG86a, MGG86b] and [RKS92, RKS93] are subsumed by our model.
This material is based in part upon work supported by NSF grants IRI-9221947, IRJ-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 the database research group at ETH, Zurich.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
G. Alonso, R. Vingralek, D. Agrawal, Y. Breitbart, A. Abbadi, H. Schek, and G. Weikum. A unified approach to concurrency control and transaction recovery. Information Systems, 19(1), 1994.
B.R. Badrinath and K. Ramamritham. Semantics-based concurrency control: beyond commutativity. ACM Transactions on Database Systems, 17(1), March 1992.
Y. Breitbart, D. Georgakopoulos, M. Rusinkiewicz and A. Silberschatz. On rigorous transaction scheduling. IEEE Transactions on Software Engineering, 17(9), 1991.
T. Hadzilacos and V. Hadzilacos. Transaction synchronization in object bases. Proc. ACM Principles of Database Systems, 1988.
T. Hadzilacos and V. Hadzilacos. Transaction synchronization in object bases. Journal of computer and system sciences, 1991.
N. Lynch, M. Merritt, W. Weihl, and A. Fekete. Atomic Transactions. Morgen Kaufmann, San Mateo, CA, 1994.
J. Moss, N. Griffeth, and M. Graham. Abstraction in concurrency control and recovery management (revised). Tech. rept. coins technical report 86-20., University of Massachusetts at Amherst, March 1986.
J. Moss, N. Griffeth, and M Graham. Abstraction in recovery management. ACM SIGMOD Conference, 15(1), 1986.
R. Rastogi, H. F. Korth, and A. Silberschatz. Strict histories in objectbased database systems. Technical report, Matsushita Information Technology Laboratory, 1992.
R. Rastogi, H. F. Korth, and A. Silberschatz. Strict histories in objectbased database systems. In Symposium on Principles of Database Systems, 1993.
Y. Raz. The principle of commitment ordering, or guaranteeing serializability in a heterogeneous, multiresource manager enviroment using atomic commitment. Proc. 18th International Conference on Very Large Data Bases, 1992.
R. Vingralek, H. Ye, Y. Breitbart, and H.-J. Schek. Unified Transaction Model for Semantically Rich Operations. Technical Report, Department of Computer Science, ETH Zurich, 1994
H.-J. Schek, G. Weikum, and H. Ye. Towards a unified theory of concurrency control and recovery. Proc. ACM Principles of Database Systems, 1993.
W.E. Weihl. Commutativity-based concurrency control for abstract data types. IEEE Transactions on Computers, 37(12), 1988.
W.E. Weihl. The impact of recovery on concurrency control. Proc. ACM Principles of Database Systems, 1989.
G. Weikum. Principles and realization strategies of multilevel transaction management. ACM Transactions on Database Systems, 16(1), 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vingralek, R., Ye, H., Breitbart, Y., Schek, H.J. (1995). Unified transaction model for semantically rich operations. In: Gottlob, G., Vardi, M.Y. (eds) Database Theory — ICDT '95. ICDT 1995. Lecture Notes in Computer Science, vol 893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58907-4_13
Download citation
DOI: https://doi.org/10.1007/3-540-58907-4_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58907-5
Online ISBN: 978-3-540-49136-1
eBook Packages: Springer Book Archive