Compensation-aware data types in RDBMS

ABSTRACT

In a traditional database system, the transaction management protocols and mechanisms are constrained by the fundamental properties of atomicity, consistency, isolation, and durability (ACID). A transaction management system with strict ACID properties typically employs read and write locks, held for the duration of the transaction, to protect its uncommitted data from being seen and modified by some other transaction. While this approach is effective for applications involving short execution times and relatively small number of concurrent operations, it is too restrictive for applications that involve reactive, long-lived, and complex transactions. The common denominator of such applications is the need for transactions to read and possibly modify uncommitted data values [1] and for the database system to still retain the ability to abort a transaction and the ability to recover from failures. This paper proposes a Business Transaction framework that allows long lasting, discontinuous, and resumable transactions to perform shared updates to common data by holding semantic locks on the modified rows. Under this framework, basic SQL data types are made compensation-aware by associating domain-specific shared update semantics with them. These semantics ensure that each data modification operation is compatible with other uncommitted activity on the same data and that the operation can be undone, if needed, without resorting to cascading aborts. This paper describes the key concepts and presents our approach for supporting shared updates in Oracle RDBMS.

REFERENCES

• 1: Henry F. Korth , Eliezer Levy , Abraham Silberschatz, A Formal Approach to Recovery by Compensating Transactions, Proceedings of the 16th International Conference on Very Large Data Bases, p.95-106, August 13-16, 1990
• 2: Philip A. Bernstein , Vassco Hadzilacos , Nathan Goodman, Concurrency control and recovery in database systems, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1987
• 3: Gawlick, D., and Kinkade, D. "Varieties of Concurrency Control in IMS/VS Fast Path", Tandem Technical Report, June 1985.
• 4: Patrick E. O'Neil, The Escrow transactional method, ACM Transactions on Database Systems (TODS), v.11 n.4, p.405-430, Dec. 1986 [doi>10.1145/7239.7265]
• 5: Hector Garcia-Molina , Kenneth Salem, Sagas, Proceedings of the 1987 ACM SIGMOD international conference on Management of data, p.249-259, May 27-29, 1987, San Francisco, California, United States
• 6: Panayiotis K. Chrysanthis , Krithi Ramamritham, ACTA: a framework for specifying and reasoning about transaction structure and behavior, Proceedings of the 1990 ACM SIGMOD international conference on Management of data, p.194-203, May 23-26, 1990, Atlantic City, New Jersey, United States
• 7: Roger S. Barga , Calton Pu, A Practical and Modular Implementation of Extended Transaction Models, Proceedings of the 21th International Conference on Very Large Data Bases, p.206-217, September 11-15, 1995
• 8: A. Biliris , S. Dar , N. Gehani , H. V. Jagadish , K. Ramamritham, ASSET: a system for supporting extended transactions, ACM SIGMOD Record, v.23 n.2, p.44-54, June 1994
• 9: Clark D. D, and Wilson, D. R. "A Comparison of Commercial and Military Computer Security Policies", In Proceedings of IEEE Symposium on security and Privacy, pp. 184--194, 1987
• 10: Oracle Database Object Relational Developer's Guide, 11g Release 1, Oracle Corp., Part# B-28371-03 Jun 2007.
• 11: Oracle Database Data Cartridge Developer's Guide, 11g Release 1, Oracle Corp., Part# B-28425-03 Jun 2007.

INDEX TERMS

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

Additional Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.4 Systems
          Subjects: Relational databases; Transaction processing

General Terms:
Algorithms, Design, Management

Keywords:
and constraints, business transactions, compensation, concurrency control