CONSISTENCY IN HIERARCHICAL DATABASE SYSTEMS.

Abraham Silberschatz, Zvi Kedem

Research output: Contribution to journalArticle

Abstract

The problems of locking and consistency in database systems are examined. It is assumed that each transaction, 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 transactions serially. These conditions are used to establish a locking protocol in hierarchical database systems. The locking protocol allows transactions to request new locks after releasing a lock. However, a data item may be locked almost at once as a result of each transaction. It is shown that the protocol ensures consistency and that it is deadlock free.

Original languageEnglish (US)
Pages (from-to)72-80
Number of pages9
JournalJournal of the ACM
Volume27
Issue number1
DOIs
StatePublished - Jan 1980

Fingerprint

Hierarchical Systems
Database Systems
Transactions
Locking
Processing
Deadlock
Transform

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Graphics and Computer-Aided Design
  • Hardware and Architecture
  • Information Systems
  • Software
  • Theoretical Computer Science

Cite this

CONSISTENCY IN HIERARCHICAL DATABASE SYSTEMS. / Silberschatz, Abraham; Kedem, Zvi.

In: Journal of the ACM, Vol. 27, No. 1, 01.1980, p. 72-80.

Research output: Contribution to journalArticle

Silberschatz, Abraham ; Kedem, Zvi. / CONSISTENCY IN HIERARCHICAL DATABASE SYSTEMS. In: Journal of the ACM. 1980 ; Vol. 27, No. 1. pp. 72-80.
@article{61813868ec734be18d275e56e44d2935,
title = "CONSISTENCY IN HIERARCHICAL DATABASE SYSTEMS.",
abstract = "The problems of locking and consistency in database systems are examined. It is assumed that each transaction, 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 transactions serially. These conditions are used to establish a locking protocol in hierarchical database systems. The locking protocol allows transactions to request new locks after releasing a lock. However, a data item may be locked almost at once as a result of each transaction. It is shown that the protocol ensures consistency and that it is deadlock free.",
author = "Abraham Silberschatz and Zvi Kedem",
year = "1980",
month = "1",
doi = "10.1145/322169.322176",
language = "English (US)",
volume = "27",
pages = "72--80",
journal = "Journal of the ACM",
issn = "0004-5411",
publisher = "Association for Computing Machinery (ACM)",
number = "1",

}

TY - JOUR

T1 - CONSISTENCY IN HIERARCHICAL DATABASE SYSTEMS.

AU - Silberschatz, Abraham

AU - Kedem, Zvi

PY - 1980/1

Y1 - 1980/1

N2 - The problems of locking and consistency in database systems are examined. It is assumed that each transaction, 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 transactions serially. These conditions are used to establish a locking protocol in hierarchical database systems. The locking protocol allows transactions to request new locks after releasing a lock. However, a data item may be locked almost at once as a result of each transaction. It is shown that the protocol ensures consistency and that it is deadlock free.

AB - The problems of locking and consistency in database systems are examined. It is assumed that each transaction, 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 transactions serially. These conditions are used to establish a locking protocol in hierarchical database systems. The locking protocol allows transactions to request new locks after releasing a lock. However, a data item may be locked almost at once as a result of each transaction. It is shown that the protocol ensures consistency and that it is deadlock free.

UR - http://www.scopus.com/inward/record.url?scp=0018918471&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0018918471&partnerID=8YFLogxK

U2 - 10.1145/322169.322176

DO - 10.1145/322169.322176

M3 - Article

VL - 27

SP - 72

EP - 80

JO - Journal of the ACM

JF - Journal of the ACM

SN - 0004-5411

IS - 1

ER -