Concurrent execution of transaction copies (Q1098626)
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: Concurrent execution of transaction copies |
scientific article; zbMATH DE number 4039283
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Concurrent execution of transaction copies |
scientific article; zbMATH DE number 4039283 |
Statements
Concurrent execution of transaction copies (English)
0 references
1987
0 references
Copies of a transaction execute concurrently when a task has to be performed at the same time by multiple database users (e.g., airline seat reservation). We assume a distributed database which controls concurrency by locking, and we present the following two results. In order to determine whether or not an arbitrarily large set of copies is deadlock- free, at least m copies must be tested for deadlock freedom, where m is the number of referenced database entities. On the other hand, to determine whether such a set ensures serializability it suffices to test only two copies.
0 references
concurrency control
0 references
schedule
0 references
distributed database
0 references
locking
0 references
deadlock
0 references
serializability
0 references
0.788775622844696
0 references
0.7837851047515869
0 references
0.7772217392921448
0 references
