Abstract
A transaction model defines the behaviour, constraints, integrity, inter-relationships, and robustness of database transactions. Such models are generally evaluated indirectly, often by experiments on a database monitor that implements the model, or by workload simulation. In this paper, we propose a novel method of comparing transaction models based on functions of architectural- and isolation-work. Using these functions, we show the complexity of ten transaction models and discuss the relationship between them. We conclude that our architectural- and isolation-work functions can be used to reason about transaction models and as one measure for selecting the model appropriate to specific applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bhargava, B.: Concurrency control in database systems. IEEE Trans. on Knowledge and Data Engineering 11, 3–16 (1999)
Gray, J., Reuter, A.: Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Francisco (1993)
Thomasian, A.: Concurrency control: Methods, performance and analysis. ACM Computing Surveys 30, 70–119 (1998)
Elmasri, R., Navathe, S.B.: Fundamentals of Database Systems, 2nd edn. Benjamin-Cummings, Redwood City (1994)
Bernstein, P.A., Newcomer, E.: Principles of Transaction Processing. Morgan Kaufmann, San Francisco (1997)
Elmagarmid, A.K. (ed.): Database Transaction Models for Advanced Applications, vol. 1. Morgan Kaufmann, San Francisco (1995)
Lynch, N., Merritt, M., Weihl, W., Fekete, A.: Atomic Transactions. Morgan Kaufmann, San Francisco (1994)
Barghouti, N.S., Kaiser, G.E.: Concurrency control in advanced database applications. ACM Computing Surveys 23, 269–317 (1991)
Weikham, G., Schek, H.J.: 13. [6]
Climent, A., Bertran, M., Nicolau, M.: Database concurrency control on a sharednothing architecture using speculative lock modes. In: Advances in Database and Information Systems, Proc. 5th East European Conf. (2001)
Franaszek, P., Robinson, J.T.: Limitations of concurrency in transaction processing. ACM Trans. on Database Systems 10, 1–28 (1985)
Tay, Y.C., Goodman, N., Suri, R.: Locking performance in centralized databases. ACM Trans. on Database Systems 10, 415–462 (1985)
Tay, Y.C., Suri, R., Goodman, N.: A mean value performance model for locking in databases: The no-waiting case. Journal of the ACM 32, 618–651 (1985)
Tay, Y.C., Suri, R., Goodman, N.: A mean value performance model for locking in databases: The waiting case. Journal of the ACM 31, 311–322 (1984)
Thomasian, A.: Two-phase locking performance and its thrashing behavior. ACM Trans. on Database Systems 18, 579–625 (1993)
Ryu, I.K., Thomasian, A.: Analysis of database performance with dynamic locking. Journal of the ACM 37, 491–523 (1990)
Yu, P.S., Dias, D.M., Lavenberg, S.S.: On the analytical modeling of database concurrency control. Journal of the ACM 40, 831–872 (1993)
Agrawal, D., Abbadi, A.E., Jeffers, R.: An approach to eliminate transaction blocking in locking protocols. In: Proc. ACM Principles of Database Systems, pp. 223–235 (1992)
Agrawal, D., Bruno, J.L., Abbadi, A.E., Krishnaswamy, V.: Relative serializability: An approach for relaxing the atomicity of transactions. In: Proc. ACM SIGMOD Int. Conf. Management of Data, pp. 139–149 (1994)
Reed, D.P.: Naming and synchronization in a decentralized computer system. Tech. Report MIT/LCS/TR-205, MIT Laboratory for Computer Science, Cambridge, Massachusetts (1978)
Ramamritham, K., Pu, C.: A formal characterisation of Epsilon serializability. IEEE Trans. Knowledge and Data Engineering 7, 997–1007 (1995)
O’Neil, P.E.: The Escrow transactional method. ACM Trans. on Database Systems 11, 405–430 (1986)
Chrysanthis, P.K., Ramamritham, K.: ACTA: A framework for specifying and reasoning about transaction structure and behavior. In: Proc. ACM SIGMOD Int. Conf. Management of Data, pp. 194–203 (1990)
Chrysanthis, P.K., Ramamritham, K.: 10. In: [6], pp. 349–398
Ramamritham, K., Chryanthis, P.K.: A taxonomy of correctness criteria in database applications. VLDB Journal 5, 85–97 (1996)
Chrysanthis, P.K., Ramamritham, K.: Synthesis of extended transaction models using ACTA. ACM Trans. on Database Systems 19, 450–491 (1994)
Wächter, H., Reuter, A.: 7. In: [6], pp. 219–264
Kaiser, G.E., Pu, C.: 8. In: [6], pp. 265–296
Kühn, E., Puntigam, F., Elmagrmid, A.K.: 9. In: [6], pp. 297–348
Fry, A.G.: Expressing database transactions as atomic-operations. In: Seventh International Database Engineering and Applications Symposium (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fry, A.G., Williams, H.E. (2003). Comparing the Overhead Requirements of Database Transaction Models. In: Mařík, V., Retschitzegger, W., Štěpánková, O. (eds) Database and Expert Systems Applications. DEXA 2003. Lecture Notes in Computer Science, vol 2736. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45227-0_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-45227-0_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40806-2
Online ISBN: 978-3-540-45227-0
eBook Packages: Springer Book Archive