Sign inSubmit
ArticleArticle metrics
Research Article · Free to read · Published 28 February 2006

On Optimistic Concurrency Control for Real-Time Database Systems

Amer A. Ali

American Journal of Applied Sciences, Volume 3, Issue 2, pp. 1706–1710 · doi.org/10.3844/ajassp.2006.1706.1710

6,901 accesses5,010 downloads1 citations (Crossref)Journal metrics
Cite Check for updates

Abstract

The performance of database transaction processing system can be profoundly affected by the concurrency control method employed since it is necessary to preserve database integrity in a multi-user environment. In addition to satisfying the consistency requirement as in traditional database system, real-time database systems must also satisfy timing constraints. In this study we present a virtual run policy for the restarted first run optimistic transactions and compare its performance with optimistic concurrency control in firm real-time database system.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2006 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Ali, A. A. (2006). On Optimistic Concurrency Control for Real-Time Database Systems. American Journal of Applied Sciences, 3(2), 1706–1710. https://doi.org/10.3844/ajassp.2006.1706.1710

Licence
© Science Publications
Issue
Volume 3, Issue 2
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
On Optimistic Concurrency Control for Real-Time Database SystemsAmerican Journal of Applied Sciences · Volume 3, Issue 2 · pp. 1706–1710 · © Science PublicationsDownload