Concurrency control of tiered flat transactions

  • W. Hussak
  • J. A. Keane
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 940)


In some database systems it has become evident that transactions can consist of a succession of ‘tiers’ where different types of data are being accessed. Despite the different nature of the data accessed by each tier the transactions cannot be split up because of the interdependencies between the albeit different data of the individual tiers. However, the tiered nature of such transactions can offer greater scope for parallel execution and hence more efficient throughput of transactions without breaching data consistency. In this paper, we extend the standard transaction model by defining formally the notion of a tiered transaction. We give a concurrency control condition on tiered transactions being executed in parallel which is weaker than the standard serializability condition. We develop the theory in the context of the ‘syntactic’ methods of classical serializability theory.

A financial database example is used to illustrate the concepts. The concurrency control condition is verified by an algebraic approach.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BBG89]
    C. Beeri, P. A. Bernstein and N. Goodman, A Model of Concurrency in Nested Transactions Systems, Journal of ACM, 36 (2), pp.230–269, April 1989.Google Scholar
  2. [BSW79]
    P. A. Bernstein, D. W. Shipman and W. S. Wong, Formal Aspects of Serializability in Database Concurrency Control, IEEE Trans. on Software Engineering, Vol. SE-5, No. 3, pp. 203–216, May 1979.Google Scholar
  3. [Dat95]
    C.J. Date, An Introduction to Database Systems, Addiosn Wesley, Sixth Ed., 1995.Google Scholar
  4. [GhB93]
    Multimedia Database Systems, A. Ghafoor and P.B. Berra, in Advanced Database Systems, N.R. Adam and B.K. Bharagava (Eds), LNCS750, Springer-Verlag, pp. 397–411,1993.Google Scholar
  5. [Gra93]
    J. Gray and A. Reuter, Transaction Processing: Concepts and Techniques, Morgan Kaufman, 1993.Google Scholar
  6. [LMW94]
    N. Lynch, M. Merritt, W. Weihl and A. Fekete, Atomic Transactions, Morgan Kauffman, 1994.Google Scholar
  7. [HuK93]
    W. Hussak and J. A. Keane, Representation of Coherency Classes for Parallel Systems, Proc. 5th IEEE Symposium on Parallel and Distributed Processing, pp. 391–398, Dallas, Texas, December 1993.Google Scholar
  8. [Kai88]
    G. E. Kaiser, Transactions for Concurrent Object-oriented Programming Systems, SIGPLAN Notices, 1988, pp. 136–138.Google Scholar
  9. [Mos85]
    J. E. B. Moss, Nested Transactions: An approach to Reliable Distributed Computing, MIT Press, Cambridge, Mass., March 1985.Google Scholar
  10. [Pap79]
    C. Papadimitriou, The Serializability of Concurrent Database Updates, Journal of ACM, 26 (4), pp. 631–653, 1979.Google Scholar
  11. [Vid87]
    K. Vidyasankar, Generalized Theory of Serializability, Acta Informatica, 24, pp. 105–119, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • W. Hussak
    • 1
  • J. A. Keane
    • 2
  1. 1.Deprtment of Computer StudiesUniversity of LoughboroughUK
  2. 2.Department of ComputationUMISTManchesterUK

Personalised recommendations