The DOI matches its Crossref record.
Semantics-based concurrency control: beyond commutativity
Open accessAbstract
The concurrency of transactions executing on atomic data types can be enhanced through the use of semantic information about operations defined on these types. Hitherto, commutativity of operations has been exploited to provide enchanced concurrency while avoiding cascading aborts. We have identified a property known as recoverability which can be used to decrease the delay involved in processing noncommuting operations while still avoiding cascading aborts. When an invoked operation is recoverable with respect to an uncommitted operation, the invoked operation can be executed by forcing a commit dependency between the invoked operation and the uncommitted operation; the transaction invoking the operation will not have to wait for the uncommitted operation to abort or commit. Further, this commit dependency only affects the order in which the operations should commit, if both commit; if either operation aborts, the other can still commit thus avoiding cascading aborts. To ensure the serializability of transactions, we force the recoverability relationship between transactions to be acyclic. Simulation studies, based on the model presented by Agrawal et al. [1], indicate that using recoverability, the turnaround time of transactions can be reduced. Further, our studies show enchancement in concurrency even when resource constraints are taken into consideration. The magnitude of enchancement is dependent on the resource contention; the lower the resource contention, the higher the improvement.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(2002) · Choice Reviews Online · doi:10.5860/choice.39-2844 · Cited by 613
Ramamritham, K. (1993) · Distributed and Parallel Databases · doi:10.1007/bf01264051 · Cited by 549
Self-citationDesign 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
Generalized isolation level definitions
Adya, A., Liskov, B., & O'Neil, P. (2002) · Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073) · doi:10.1109/icde.2000.839388 · Cited by 176
Metadata
- Authors
- Badrinath, B. R., & Ramamritham, K.
- Venue
- ACM Transactions on Database Systems
- Published
- 1992-03
- Volume
- 17
- Issue
- 1
- Pages
- 163-199
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2140876280
- Cited by
- 177
- References
- 0
- FWCI
- 17.38
- 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: Semantics-based concurrency control: beyond commutativity. https://app.cochat.ai/papers/10.1145/128765.128771
- The paper
- Badrinath, B. R., & Ramamritham, K. (1992). Semantics-based concurrency control: beyond commutativity. ACM Transactions on Database Systems. https://doi.org/10.1145/128765.128771
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.