• Jun 03, 2019 News!Vol.9, No.5-Vol.10, No.3 have been indexed by EI (Inspec).   [Click]
  • Jun 18, 2021 News!Vol.13, No.3 has been published with online version.   [Click]
  • Apr 09, 2021 News!Vol.13, No.2 has been published with online version.   [Click]
General Information
Prof. Wael Badawy
Department of Computing and Information Systems Umm Al Qura University, Canada
I'm happy to take on the position of editor in chief of IJCTE. We encourage authors to submit papers concerning any branch of computer theory and engineering.
IJCTE 2017 Vol.9(1): 20-23 ISSN: 1793-8201
DOI: 10.7763/IJCTE.2017.V9.1104

Dynamic Timestamps Ordering for Controlling Concurrency

A. (Zizo) Farrag
Abstract—This paper proposes several timestamp ordering mechanisms for controlling concurrency in which the timestamps assigned to transactions can be modified dynamically during execution. These timestamps are not stored with the (database) variables and the process of modifying them is simple. The proposed mechanisms achieve a higher level of concurrency (than traditional timestamp ordering mechanisms) for the following reasons. First, the operations of (certain classes of) read-only transactions can always be accepted. Second, when an operation by an update transaction arrives out of order, the mechanism avoids rejecting it by modifying, if possible, the timestamps of some transactions. The proposed mechanisms do not require multiversion of each entity to be maintained.

Index Terms—Concurrency control, database, timestamps ordering, transaction.

A. (Zizo) Farrag is with Dalhousie University, Canada (e-mail: farrag@cs.dal.ca).


Cite:A. (Zizo) Farrag, "Dynamic Timestamps Ordering for Controlling Concurrency," International Journal of Computer Theory and Engineering vol. 9, no. 1, pp. 20-23, 2017.

Copyright © 2008-2021. International Association of Computer Science and Information Technology. All rights reserved.