Introduction to the theory of nested transactions (Q1119399)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Introduction to the theory of nested transactions |
scientific article; zbMATH DE number 4098743
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Introduction to the theory of nested transactions |
scientific article; zbMATH DE number 4098743 |
Statements
Introduction to the theory of nested transactions (English)
0 references
1988
0 references
A formal model is introduced and investigated with respect to concurrency and resiliency properties of nested transaction systems. The model consists of a set of I/O automation (representing nested transactions) with a distinguished one called the scheduler. Main results are as follows: Serial correctness conditions are given for transaction interfaces; correctness conditions for locking algorithm of Moss (1985) are explicitely given.
0 references
concurrency
0 references
concurrent schedules
0 references
nested transaction
0 references
locking algorithm
0 references
