A model for concurrency in nested transactions systems

@article{Beeri1989AMF,
  title={A model for concurrency in nested transactions systems},
  author={C. Beeri and P. Bernstein and N. Goodman},
  journal={J. ACM},
  year={1989},
  volume={36},
  pages={230-269}
}
  • C. Beeri, P. Bernstein, N. Goodman
  • Published 1989
  • Computer Science
  • J. ACM
  • Today's standard model for database concurrency control, called serializability theory, represents executions of transactions as partial orders of operations. The theory tells when an execution is serializable, that is, when the set of operations of a transaction execute atomically with respect to those of other transactions. It has been used successfully to prove correctness of most database concurrency control algorithms. Its most serious limitation is its inability to represent nested… CONTINUE READING
    204 Citations
    A Model of Concurrency in Object-Oriented Databases
    • 1
    • Highly Influenced
    • PDF
    Commutativity-Based Locking for Nested Transactions
    • 56
    • PDF
    Synchronization in nested transactions
    • 6
    Transaction Synchronisation in Object Bases
    • 38
    Formal model of correctness without serializabilty
    • 126
    Formal aspects of concurrency control in long-duration transaction systems using the NT/PV model
    • 67
    • Highly Influenced
    Concurrency control issues in nested transactions
    • 36
    • PDF

    References

    AND MERRITT, M. Introduction to the theory of nested transactions. MIT/LCS/TR367
    • MIT Laboratory for Computer Science,
    • 1986