|Title||Bounding the Effects of Compensation under Relaxed Multi-Level Serializability|
|Publication Type||Journal Article|
|Year of Publication||1996|
|Authors||Amit Sheth, A. Cichocki, G. Thomas, P. Krychniak, Marek Rusinkiewicz|
|Journal||Distributed and Parallel Databases|
|Keywords||compensation, consistency, relaxed transactions, serializability, transaction Management|
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 diculties 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.
|Full Text|| |
P. Krychniak, M. Rusinkiewicz, A. Cichocki, A. Sheth, and G. Thomas, 'Bounding the Effects of Compensation under Relaxed Multi-Level Serializability,': Distributed and Parallel Databases 4 (no. 4), 1996, pp. 355-374. (DOI: 10.1007/BF00119339)
related resource url: http://scholar.google.com/citations?view_op=view_citation&hl=en&user=2T3...