Article

Free access

Concurrency in database systems: a simulation study

Authors:

Rudolf Munz,

Gunter KrenzAuthors Info & Claims

SIGMOD '77: Proceedings of the 1977 ACM SIGMOD international conference on Management of data

Pages 111 - 120

https://doi.org/10.1145/509404.509421

Published: 03 August 1977 Publication History

PDF eReader

Abstract

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?

References

[1]

Astrahan, M. M. et al.: System R: A Relational Approach to Data Base Management, IBM Research Report RJ 1738, Feb. 1976

Google Scholar

[2]

Chamberlin, D. D.; Boyce, R. F.; Traiger, I. L.: A Deadlock-Free Scheme for Resource Locking in a Data-Base Environment, Proc. IFIP 1974 Congress, Stockholm

Google Scholar

[3]

Coffman, E. G.; Elphick, M. J.; Shoshani, A.: System Deadlocks, Computing Surveys, Vol. 3, No. 2, June 1971

Digital Library

Google Scholar

[4]

Eswaran, K. P. et al.: On the Notions of Consistency and Predicate Locks in a Database System, IBM Research Report RJ 1487, Dec. 1974

Google Scholar

[5]

King, P. F.; Collmeyer, A. J.: Database Sharing - an efficient Mechanism for Supporting Concurrent Processes, Proc. AFIPS National Computer Conference 1973

Google Scholar

[6]

Macri, P.: Deadlock Detection and Resolution in a CODASYL based Data Management System, Proc. ACM SIGMOD 1976

Crossref

Google Scholar

[7]

Shemer, J. E.; Collmeyer, A. J.: Database Sharing: a Study of Interference, Roadblock and Deadlock, Proc. 1972 ACM SIGFIDET Workshop

Digital Library

Google Scholar

Cited By

View all

Force CPastre J(2011)Accès non uniformément répartis dans une base de données : généralisation d'une approche probabilisteRAIRO - Operations Research10.1051/ro/199024010049124:1(49-66)Online publication date: 29-Mar-2011
https://doi.org/10.1051/ro/1990240100491
Force CPastre J(2011)Accès non uniformément répartis dans une base de données : approche probabiliste et modélisationRAIRO - Operations Research10.1051/ro/198620040321120:4(321-339)Online publication date: 29-Mar-2011
https://doi.org/10.1051/ro/1986200403211
(2003)Comparison Analysis of Concurrency Control Algorithms by using Selection ModelsThe KIPS Transactions:PartA10.3745/KIPSTA.2003.10A.2.13110A:2(131-136)Online publication date: 1-Jun-2003
https://doi.org/10.3745/KIPSTA.2003.10A.2.131
Show More Cited By

Recommendations

Optimistic concurrency control algorithms for distributed database systems
Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems
SIGMOD '15: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data

Multi-Version Concurrency Control (MVCC) is a widely employed concurrency control mechanism, as it allows for execution modes where readers never block writers. However, most systems implement only snapshot isolation (SI) instead of full ...
Multiversion Cautious Schedulers for Database Concurrency Control

Let MC stand for a class of logs (i.e. sequences of read/write steps of transactions) that are serializable when multiple versions of the data items are maintained. The multiversion cautious scheduler, MCS(MC) which is introduced, outputs a sequence ...

Comments

Information & Contributors

Information

Published In

SIGMOD '77: Proceedings of the 1977 ACM SIGMOD international conference on Management of data

August 1977

181 pages

ISBN:9781450373432

DOI:10.1145/509404

Conference Chair:
J. B. Fry
University of Michigan
,
General Chair:
W. Frank King
IBM Research Lab
,
Program Chair:
Diane C. P. Smith
University of Utah

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 August 1977

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
329
Total Downloads

Downloads (Last 12 months)29
Downloads (Last 6 weeks)11

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Force CPastre J(2011)Accès non uniformément répartis dans une base de données : généralisation d'une approche probabilisteRAIRO - Operations Research10.1051/ro/199024010049124:1(49-66)Online publication date: 29-Mar-2011
https://doi.org/10.1051/ro/1990240100491
Force CPastre J(2011)Accès non uniformément répartis dans une base de données : approche probabiliste et modélisationRAIRO - Operations Research10.1051/ro/198620040321120:4(321-339)Online publication date: 29-Mar-2011
https://doi.org/10.1051/ro/1986200403211
(2003)Comparison Analysis of Concurrency Control Algorithms by using Selection ModelsThe KIPS Transactions:PartA10.3745/KIPSTA.2003.10A.2.13110A:2(131-136)Online publication date: 1-Jun-2003
https://doi.org/10.3745/KIPSTA.2003.10A.2.131
Kumar VGaddipati N(2000)An efficient CCM KRISHNA for high contention environment and its performance comparison with WDLData & Knowledge Engineering10.1016/S0169-023X(00)00008-234:1(39-76)Online publication date: 1-Jul-2000
https://dl.acm.org/doi/10.1016/S0169-023X%2800%2900008-2
Thomasian ARyu I(1991)Performance Analysis of Two-Phase LockingIEEE Transactions on Software Engineering10.1109/32.9044317:5(386-402)Online publication date: 1-May-1991
https://dl.acm.org/doi/10.1109/32.90443
Tay YGoodman NSuri R(1985)Locking performance in centralized databasesACM Transactions on Database Systems10.1145/4879.488010:4(415-462)Online publication date: 1-Dec-1985
https://dl.acm.org/doi/10.1145/4879.4880
Tay YSuri R(1984)Choice and Performance in Locking for DatabasesProceedings of the 10th International Conference on Very Large Data Bases10.5555/645912.671151(119-128)Online publication date: 27-Aug-1984
https://dl.acm.org/doi/10.5555/645912.671151
Tay YSuri RGoodman NRosenkrantz DFagin R(1984)A mean value performance model for locking in databasesProceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems10.1145/588011.588056(311-322)Online publication date: 2-Apr-1984
https://dl.acm.org/doi/10.1145/588011.588056
Goodman NSuri RTay YFagin RBernstein P(1983)A simple analytic model for performance of exclusive locking in database systemsProceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems10.1145/588058.588084(203-215)Online publication date: 21-Mar-1983
https://dl.acm.org/doi/10.1145/588058.588084
Potier DLeblanc P(1980)Analysis of locking policies in database management systemsCommunications of the ACM10.1145/359015.35902123:10(584-593)Online publication date: 1-Oct-1980
https://dl.acm.org/doi/10.1145/359015.359021
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Optimistic concurrency control algorithms for distributed database systems

Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems

Multiversion Cautious Schedulers for Database Concurrency Control

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Recommendations

Optimistic concurrency control algorithms for distributed database systems

Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems

Multiversion Cautious Schedulers for Database Concurrency Control

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations