The DOI matches its Crossref record.
Efficient optimistic concurrency control using loosely synchronized clocks
Open accessAbstract
This paper describes an efficient optimistic concurrency control scheme for use in distributed database systems in which objects are cached and manipulated at client machines while persistent storage and transactional support are provided by servers. The scheme provides both serializability and external consistency for committed transactions; it uses loosely synchronized clocks to achieve global serialization. It stores only a single version of each object, and avoids maintaining any concurrency control information on a per-object basis; instead, it tracks recent invalidations on a per-client basis, an approach that has low in-memory space overhead and no per-object disk overhead. In addition to its low space overheads, the scheme also performs well. The paper presents a simulation study that compares the scheme to adaptive callback locking, the best concurrency control scheme for client-server object-oriented database systems studied to date. The study shows that our scheme outperforms adaptive callback locking for low to moderate contention workloads, and scales better with the number of clients. For high contention workloads, optimism can result in a high abort rate; the scheme presented here is a first step toward a hybrid scheme that we expect to perform well across the full range of workloads.
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
Cited by
Spanner: Google's globally-distributed database
Corbett, J. C., Dean, J. B., Epstein, M., Fikes, A., Frost, C., Furman, J. J., Ghemawat, S., Gubarev, A., Heiser, C., Hochschild, P., et al. (2012) · doi:10.5555/2387880.2387905 · Cited by 807
Spanner: Google’s Globally Distributed Database
Corbett, J. C., Dean, J., Epstein, M., Fikes, A., Frost, C., Furman, J. J., Ghemawat, S., Gubarev, A., Heiser, C., Hochschild, P., et al. (2013) · ACM Transactions on Computer Systems · doi:10.1145/2491245 · Cited by 729
(2002) · Choice Reviews Online · doi:10.5860/choice.39-2844 · Cited by 613
Corbett, J. C., Hochschild, P., Hsieh, W. C., Kanthak, S., Kogan, E., Li, H., Lloyd, A., Melnik, S., Mwaura, D., Nagle, D. F., et al. (2013) · ACM Transactions on Computer Systems · doi:10.1145/2518037.2491245 · Cited by 331
Design and evaluation of a conit-based continuous consistency model for replicated services
Yu, H., & Vahdat, A. (2002) · ACM Transactions on Computer Systems · doi:10.1145/566340.566342 · Cited by 289
Metadata
- Authors
- Adya, A., Gruber, R., Liskov, B., & Maheshwari, U.
- Venue
- Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95
- Publisher
- ACM Press
- Published
- 1995
- Pages
- 23-34
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2110026634
- Cited by
- 169
- References
- 0
- FWCI
- 7.39
- Type
- conference paper
- Language
- en
- Open access
- hybrid
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: Efficient optimistic concurrency control using loosely synchronized clocks. https://app.cochat.ai/papers/10.1145/223784.223787
- The paper
- Adya, A., Gruber, R., Liskov, B., & Maheshwari, U. (1995). Efficient optimistic concurrency control using loosely synchronized clocks. Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95. https://doi.org/10.1145/223784.223787
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.