论文信息 - Concurrency in database systems: a simulation study

Concurrency in database systems: a simulation study

A simulation model of concurrent updates in a database system is presented. This model is used, to answer the following questions: How frequent are deadlocks in certain environments? What about concurrency and wait-time of user processes as a function of the synchronization method used? In case of a deadlock what are useful criteria to select the process to be rolled back? How many checkpoints make sense?

Rudolf Munz | Gunter Krenz

[1] Philip P. Macri,et al. Deadlock detection and resolution in a CODASYL based data management system , 1976, SIGMOD '76.

[2] Jack E. Shemer,et al. Database sharing: A study of interference, roadblock and deadlock , 1972, SIGFIDET '72.

[3] Irving L. Traiger,et al. System R: relational approach to database management , 1976, TODS.

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

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

[6] Irving L. Traiger,et al. System R: A Relational Approach to Data Base Management , 1976, Berkeley Workshop.

[7] Irving L. Traiger,et al. A Deadlock-Free Scheme for Resource Locking in a Data-Base Environment , 1974, IFIP Congress.

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