The Escrow transactional method

ABSTRACT

A method is presented for permitting record updates by long-lived transactions without forbidding simultaneous access by other users to records modified. Earlier methods presented separately by Gawlick and Reuter are comparable but concentrate on “hot-spot” situations, where even short transactions cannot lock frequently accessed fields without causing bottlenecks. The Escrow Method offered here is designed to support nonblocking record updates by transactions that are “long lived” and thus require long periods to complete. Recoverability of intermediate results prior to commit thus becomes a design goal, so that updates as of a given time can be guaranteed against memory or media failure while still retaining the prerogative to abort. This guarantee basically completes phase one of a two-phase commit, and several advantages result: (1) As with Gawlick's and Reuter's methods, high-concurrency items in the database will not act as a bottleneck; (2) transaction commit of different updates can be performed asynchronously, allowing natural distributed transactions; indeed, distributed transactions in the presence of delayed messages or occasional line disconnection become feasible in a way that we argue will tie up minimal resources for the purpose intended; and (3) it becomes natural to allow for human interaction in the middle of a transaction without loss of concurrent access or any special difficulty for the application programmer. The Escrow Method, like Gawlick's Fast Path and Reuter's Method, requires the database system to be an “expert” about the type of transactional updates performed, most commonly updates involving incremental changes to aggregate quantities. However, the Escrow Method is extendable to other types of updates.

REFERENCES

• 1: C. J. Date, An introduction to database systems: vol. I (4th ed.), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
• 2: GAWLICK, D. Processing "hot spots" in high performance systems. In Proceedings of Spring COMPCON 85, 30th IEEE Computer Society International Conference (San Francisco, Calif.), IEEE, New York, 1985, 249-251.
• 3: GAWLICK, D., AND KINKADE, D. Varieties of concurrency control in IMS/VS Fast Path. Bull. IEEE Database Eng. 8, 2 (June 1985), 3-10.
• 4: GRAY, J. Notes on Data Base Operating Systems: Operating Systems--An Advanced Course. Springer-Verlag, New York, 1979.
• 5: GRAY, J. The transaction concept: Virtues and limitations. In Proceedings of the 7th VLDB Conference (Cannes, France). 1981, pp. 144-154.
• 6: Theo Haerder , Andreas Reuter, Principles of transaction-oriented database recovery, ACM Computing Surveys (CSUR), v.15 n.4, p.287-317, December 1983 [doi>10.1145/289.291]
• 7: IBM. IBM Program Product General Information Manual GH20-9069-2, IMS/VS Version 1 Fast Path Feature.
• 8: KEYDATA CORP. Keydata Order Entry Service Summary. Keydata Corp., Watertown, Mass., 1977.
• 9: Andreas Reuter, Concurrency on high-traffic data elements, Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems, March 29-31, 1982, Los Angeles, California [doi>10.1145/588111.588126]
• 10: SCHLAGEVER, G. Enhancement of Concurrency in Database Systems by the Use of Special Rollback Methods, Data Base Architecture. North-Holland, Amsterdam, 1979.
• 11: Jeffrey D. Ullman, Principles of Database Systems, W. H. Freeman & Co., New York, NY, 1983

INDEX TERMS

Classification:
  D. Software
  D.4 OPERATING SYSTEMS
      D.4.1 Process Management
          Subjects: Concurrency; Deadlocks

  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.2 Physical Design
          Subjects: Recovery and restart
      H.2.4 Systems
          Subjects: Distributed databases; Transaction processing
          Nouns: Escrow

General Terms:
Algorithms, Design, Performance, Theory