Bounding the effects of compensation under relaxed multi-level serializability
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
The multi-level transaction concept provides a powerful tool for structuring activities in multidatabase systems. However, even multi-level serializability is sometimes too restrictive as a correctness criterion, either because of very high concurrency requirements, or because of the practical difficulties of implementing a scheduler in actual production environments. The extended multi-level transaction model presented in this paper supports higher concurrency in cases where higher level operations commute in one direction, but not in the other-i.e., when it is valid to interchange them when they occur in one order in a history, but not when they occur in the other order. We introduce a relaxed correctness criterion based on allowing a bounded number of out of order conflicts at each level in the multi-level framework, where the bound can be different for different levels. Finally we discuss the properties of compensation in this framework, developing a theory of compensation which depends only on the semantics of the operations and not on the particular state of the database. We illustrate the use of these concepts in the context of a particular class of practical applications.
- C. Beeri, P.A. Bernstein, and N. A. Goodman. A model for concurrency control in nested transaction systems.Journal of ACM, 1(1), Jan. 1989.
- P.A. Bernstein, V. Hadzilacos, and N. Goodman.Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
- P. Bernstein, M. Hsu, and B. Mann. Implementing Recoverable Requests Using Queues. InProceedings of ACM SIGMOD Conference on Management of Data, 1990.
- B.R. Badrinath and K. Ramamritham. Semantics-based concurrency control: Beyond commutativity. InProceedings of the ACM SIGMOD Conference, 1987.
- Y. Breitbart, D. Georgakopoulos, M. Rusinkiewicz, and A. Silberschatz. On Rigorous Transaction Scheduling.IEEE Transactions on Software Engineering, 17(9):954–960, September 1991.
- H. Garcia-Molina and K. Salem. SAGAS. InProceedings of ACM SIGMOD Conference on Management of Data, 1987, pages 249–259.
- J.N. Gray. The Transaction Concept: Virtues and Limitations. InProceedings of the 7th International Conference on VLDB, September 1981, pages 144–154.
- S. Ben Hassen and M. Rusinkiewicz. Concurrency Control for Distributed Nested Transactions. InProceedings of the 12th International Conference of Distributed Computing Systems, June 1992.
- M. Hsu and A. Silberschatz. Persistent Transmission and Unilateral Commit. InProceedings of the 7th IEEE Conference on Data Engineering, April 1991.
- N. Krishnakumar and A. Bernstein Bounded Ignorance in Replicated Systems. InProceedings of the Symposium on Principles of Database Systems, May 1992.
- H. F. Korth, E. Levy, and A. Silberschatz. A Formal Approach to Recovery by Compensating Transactions. InProceedings of the 16th International Conference on VLDB, 1990.
- E. Levy, H.F. Korth, and A. Silberschatz. An Optimistic Commit Protocol for Distributed Transaction Management. InProceedings of ACM-SIGMOD International Conference on Management of Data, 1990.
- N. Lynch. Multi-level Atomicity-a New Correctness Criterion for Database Concurrency Control.ACM Transactions on Database Systems, 8(4):485–502, December 1983.
- J.E.B Moss.Nested Transactions: An Approach to Reliable Distributed Computing. PhD thesis, MIT Press, Cambridge, MA, 1985.
- E. Moss, N. Griffeth, and M. Graham. Abstraction in Recovery Management. InProceedings of ACM-SIGMOD International Conference on Management of Data, 1986.
- P. Muth, W. Klas and E.J. Neuhold. How to handle Global Transactions in Heterogeneous Database Systems. InProc. 2nd Intl. Workshop on Research Issues in Data Engineering: Transaction and Query Processing, 1992.
- C. Pu and A. Leff. Epsilon-Serializability. Technical Report CUCS-054-90, Dept. of Computer Science, Columbia University, January 1991.
- C. Pu and A. Leff. Autonomous Transaction Execution with Epsilon Serializability. InProceedings of 1992 RIDE Workshop on Transaction and Query Processing, 1992.
- H.-J. Schek, G. Weikum and W. Schaad. A Multi-level Transaction Approach to Federated DBMS Transaction Management. InProc. 1st Intl. Workshop on Research Issues in Data Engineering: Interoperability in Multidatabase Systems, 1991.
- M. H. Wong and D. Agrawal. Tolerating Bounded Inconsistency for Increasing Concurrency in Database Systems. InProceedings of the Eleventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 1992.
- W. E. Weihl. Commutativity-based Concurrency control for Abstract Data Type.IEEE Transactions on Computers, 37(12):205–218, Dec. 1988.
- W. E. Weihl. The Impact of Recovery on Concurrency Control.Technical Report MIT/LCS/TM-382, Laboratory for Computer Science, Massachusetts Institute of Technology Feb. 1989.
- G. Weikum. Principles and Realization Strategies of Multilevel Transaction Management.ACM TODS, 16(1):132–180, March 1991.
- G. Weikum and H. Schek. Concepts and Applications of Multilevel Transactions and Open-Nested Transactions. In A. Elmagarmid, editor,Transaction Models for Advanced Database Applications, chapter 13, Morgan-Kaufmann, February 1992.
- K.L. Wu, P.S. Yu, and C. Pu. Divergence Control for Epsilon-serializability. InProceeding of the 8th IEEE Conference on Data Engineering, February 1992.
- Bounding the effects of compensation under relaxed multi-level serializability
Distributed and Parallel Databases
Volume 4, Issue 4 , pp 355-374
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- Multidatabase Transactions
- Relaxed Correctness Criteria
- Industry Sectors
- Author Affiliations
- 1. Computer Science Department, University of Houston, 77204-3475, Houston, TX
- 2. LSDIS Lab, Dept. of Computer Science, Univ. of Georgia, 415 GSRC, 30602-7404, GA
- 3. Bellcore, RRC-1N275, 444 Hoes Lane, 08854-4182, Piscataway, NJ