The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Concurrency control performance modeling: alternatives and implications
Open accessAbstract
A number of recent studies have examined the performance of concurrency control algorithms for database management systems. The results reported to date, rather than being definitive, have tended to be contradictory. In this paper, rather than presenting “yet another algorithm performance study,” we critically investigate the assumptions made in the models used in past studies and their implications. We employ a fairly complete model of a database environment for studying the relative performance of three different approaches to the concurrency control problem under a variety of modeling assumptions. The three approaches studied represent different extremes in how transaction conflicts are dealt with, and the assumptions addressed pertain to the nature of the database system's resources, how transaction restarts are modeled, and the amount of information available to the concurrency control algorithm about transactions' reference strings. We show that differences in the underlying assumptions explain the seemingly contradictory performance results. We also address the question of how realistic the various assumptions are for actual database systems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The notions of consistency and predicate locks in a database system
Eswaran, K. P., Gray, J. N., Lorie, R. A., & Traiger, I. L. (1976) · Communications of the ACM · doi:10.1145/360363.360369 · Cited by 1,956
On optimistic methods for concurrency control
Kung, H. T., & Robinson, J. T. (1981) · ACM Transactions on Database Systems · doi:10.1145/319566.319567 · Cited by 1,439
Concurrency Control in Distributed Database Systems
Bernstein, P. A., & Goodman, N. (1981) · ACM Computing Surveys · doi:10.1145/356842.356846 · Cited by 1,186
The serializability of concurrent database updates
Papadimitriou, C. H. (1979) · Journal of the ACM · doi:10.1145/322154.322158 · Cited by 1,021
A Majority consensus approach to concurrency control for multiple copy databases
Thomas, R. H. (1979) · ACM Transactions on Database Systems · doi:10.1145/320071.320076 · Cited by 1,003
Stonebraker, M., & Rowe, L. A. (1986) · ACM SIGMOD Record · doi:10.1145/16856.16888 · Cited by 696
System Level Concurrency Control for Distributed Database Systems
Rosenkrantz, D. J., Stearns, R. E., & Lewis, P. (1978) · Springer eBooks · doi:10.1007/978-1-4020-9688-4_4 · Cited by 386
NAMING AND SYNCHRONIZATION IN A DECENTRALIZED COMPUTER SYSTEM
Reed, D. P. (1978) · Defense Technical Information Center (DTIC) · Cited by 326
The performance of multiversion concurrency control algorithms
Carey, M. J., & Muhanna, W. A. (1986) · ACM Transactions on Computer Systems · doi:10.1145/6513.6517 · Cited by 98
Self-citationThe Performance of Alternative Strategies for Dealing with Deadlocks in Database Management Systems
Agrawal, R., Carey, M. J., & McVoy, L. (1987) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1987.233145 · Cited by 98
Self-citation
Cited by
(2002) · Choice Reviews Online · doi:10.5860/choice.39-2844 · Cited by 613
Serializable isolation for snapshot databases
Cahill, M. J., Röhm, U., & Fekete, A. D. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376690 · Cited by 120
Metadata
- Authors
- Agrawal, R., Carey, M. J., & Livny, M.
- Venue
- ACM Transactions on Database Systems
- Published
- 1987-11
- Volume
- 12
- Issue
- 4
- Pages
- 609-654
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2102333161
- Cited by
- 393
- References
- 12
- FWCI
- 15.34
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Concurrency control performance modeling: alternatives and implications. https://app.cochat.ai/papers/10.1145/32204.32220
- The paper
- Agrawal, R., Carey, M. J., & Livny, M. (1987). Concurrency control performance modeling: alternatives and implications. ACM Transactions on Database Systems. https://doi.org/10.1145/32204.32220
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.