论文信息 - Consistency in Hierarchical Database Systems

Consistency in Hierarchical Database Systems

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 ~s shown that the protocol ensures consistency and that tt ts deadlock free.

Abraham Silberschatz | Zvi M. Kedem | A. Silberschatz | Z. Kedem

[1] Paul F. King,et al. Database sharing: an efficient mechanism for supporting concurrent processes , 1973, AFIPS National Computer Conference.

[2] Franco P. Preparata,et al. Introduction to Discrete Structures for Computer Science and Engineering , 1973 .

[3] Irving L. Traiger,et al. Granularity of locks in a shared data base , 1975, VLDB '75.

[4] Irving L. Traiger,et al. The notions of consistency and predicate locks in a database system , 1976, CACM.

[5] Daniel J. Rosenkrantz,et al. System level concurrency control for distributed database systems , 1978, TODS.

[6] Frederick H. Lochovsky,et al. Hierarchical Data-Base Management: A Survey , 1976, CSUR.

[7] Michael Stonebraker,et al. Effects of locking granularity in a database management system , 1977, TODS.

[8] Arie Shoshani,et al. System Deadlocks , 1971, CSUR.

[9] Daniel J. Rosenkrantz,et al. Concurrency control for database systems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).