ACTA: a framework for specifying and reasoning about transaction structure and behavior

ABSTRACT

Recently, a number of extensions to the traditional transaction model have been proposed to support new information-intensive applications such as CAD/CAM and software development. However, these extended models capture only a subset of interactions that can be found in such applications, and represent only some of the points within the spectrum of interactions possible in competitive and cooperative environments. ACTA is a formalizable framework developed for characterizing the whole spectrum of interactions. The ACTA framework is not yet another transaction model, but is intended to unify the existing models. ACTA allows for specifying the structure and the behavior of transactions as well as for reasoning about the concurrency and recovery properties of the transactions. In ACTA, the semantics of interactions are expressed in terms of transactions' effects on the commit and abort of other transactions and on objects' state and concurrency status (i.e., synchronization state). Its ability to capture the semantics of previously proposed transaction models is indicative of its generality. The reasoning capabilities of this framework have also been tested by using the framework to study the properties of a new model that is derived by combining two existing transaction models.

REFERENCES

• 1: B. R. Badrinath , Krithi Ramamritham, Concurrency control in complex information systems: a semantics-based approach, 1989
• 2: B. R. Badrinath , Krithi Ramamritham, Semantics-Based Concurrency Control: Beyond Commutativity, Proceedings of the Third International Conference on Data Engineering, p.304-311, February 03-05, 1987
• 3: Bancflhon, F , Klm, W , and Korth, H A model of CAD Transactions In Proceedtngs of the 11th tnternatsonal conference on VLDB, pages 25-33, Stockholm, August 1985
• 4: Chrvsanthls, P K and Kamamntham, K Capturing the structure and the behavior of complex transactions In Proceedzngs of the Thtrd Workshop on Large Grain Parallehsm, SEI, Carnegie Mellon Umverslty, Pittsburgh, October 1989
• 5: K. P. Eswaran , J. N. Gray , R. A. Lorie , I. L. Traiger, The notions of consistency and predicate locks in a database system, Communications of the ACM, v.19 n.11, p.624-633, Nov. 1976 [doi>10.1145/360363.360369]
• 6: Mary F. Fernandez , Stanley B. Zdonik, Transaction Groups: A Model for Controlling Cooperative Transactions, Proceedings of the Third International Workshop on Persistent Object Systems, p.341-350, January 10-13, 1989
• 7: Gray, J The transaction concept Vxrtues and hmltatlons In Proceed;ngs of the 7th VLDB Conference, pages 144-154, September 1981
• 8: Gray, J N, Lone, R A, Putzulo, G R, and Tralger, I L Granularity of locks and degrees of conmstency m a shared database In Proceedings of the 1st znternat~onal conference on VLDB, pages 25-33, Frammgham, MA , September 1975
• 9: Maurice P. Herlihy , William E. Weihl, Hybrid concurrency control for abstract data types, Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.201-210, March 1988, Austin, Texas, United States [doi>10.1145/308386.308440]
• 10: Martin, B E Scheduhng protocols for nested ob- 2ects Technical Report CS-094, Department of Computer Science and Engineering, Umvermty of Cahfornm, San Diego, Cahforma, 1988
• 11: Moss, J E B Nested Transactions An approach to rehable distributed computing PhD thesis 260, Massachusetts Institute of Technology, Cambridge, MA, April 1981
• 12: J. Eliot B Moss , Nancy D. Griffeth , Marc H. Graham, Abstraction in recovery management, Proceedings of the 1986 ACM SIGMOD international conference on Management of data, p.72-83, May 28-30, 1986, Washington, D.C., United States
• 13: Calton Pu, Replication and nested transactions in the eden distributed system (superdatabase, object-oriented), 1986
• 14: Calton Pu , Gail E. Kaiser , Norman C. Hutchinson, Split-Transactions for Open-Ended Activities, Proceedings of the 14th International Conference on Very Large Data Bases, p.26-37, August 29-September 01, 1988
• 15: Peter M. Schwarz , Alfred Z. Spector, Synchronizing shared abstract types, ACM Transactions on Computer Systems (TOCS), v.2 n.3, p.223-250, Aug. 1984 [doi>10.1145/989.1188]
• 16: Shnvastava, S K and Wheater, S M Ob2ects and multl-coloured actions In Thzrd Workshop on Large Gram Paralelhsm, SEI, Carnegie Mellon Umvermty, Pittsburgh, October 1989
• 17: Andrea H. Skarra , Stanley B. Zdonik, Concurrency control and object-oriented databases, Object-oriented concepts, databases, and applications, ACM Press, New York, NY, 1989 [doi>10.1145/63320.66511]
• 18: Vmter, S, Ramamntham, K , and Stemple, D Recoverable actions in gutenberg In Proceeding8 of the Szxth Internatzonal conference on Dzst.mbuted Computing Systems, pages 242-249, May 1986
• 19: W. E. Weihl, Commutativity-Based Concurrency Control for Abstract Data Types, IEEE Transactions on Computers, v.37 n.12, p.1488-1505, December 1988 [doi>10.1109/12.9728]

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.4 Systems
          Subjects: Transaction processing

Additional Classification:
  D. Software
  D.4 OPERATING SYSTEMS

  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.1 Logical Design
          Subjects: Data models
      H.2.4 Systems
          Subjects: Concurrency

General Terms:
Algorithms, Design