Abstract
The problems of locking and consistency m database systems are examined It is assumed that each transacuon, when executed alone, transforms a consistent state into a consistent state A set of conditions is derived to guarantee that when transactions are processed concurrently, the results are the same as would be obtained by processing the transactmns serially These conditions are used to estabhsh a locking protocol in Merarchmal database systems The locking protocol allows transaeuons to request new locks after releasing a lock. However, a data item may be locked at most once as a result of each transacUon It is shown that the protocol ensures consistency and that tt ts deadlock free.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 72-80 |
| Number of pages | 9 |
| Journal | Journal of the ACM (JACM) |
| Volume | 27 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 1 1980 |
Keywords
- concurrency
- conststency
- database
- deadlock
- lock
- mtegrtty
- sertahzabdtty
- transacUon
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Information Systems
- Hardware and Architecture
- Artificial Intelligence