Is distributed locking harder? (Q1061510): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-0000(84)90078-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1963591123 / rank | |||
Normal rank | |||
Revision as of 00:07, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Is distributed locking harder? |
scientific article |
Statements
Is distributed locking harder? (English)
0 references
1984
0 references
The problem of determining whether a set of locked transactions, accessing a distributed database, is guaranteed to produce only serializable schedules is examined. For a pair of transactions, with n steps, it is proved that this concurrency control problem, which is polynomially solvable for centralized databases, is in general coNP- complete. A new graph-theoretic technique is employed and an \(O(n^ 2)\) test for the special case of databases distributed between two sites is provided.
0 references
locked transactions
0 references
distributed database
0 references
serializable schedules
0 references
concurrency control
0 references
coNP-complete
0 references
graph-theoretic technique
0 references
