By Topic

Performance Evaluation of an Optimistic Concurrency Control Algorithm for Temporal Databases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Makni, A. ; Fac. des Sci. Econ. et de Gestion de Sfax, Sfax, Tunisia ; Bouaziz, R.

We propose in this paper a performance study of an access concurrency control algorithm for temporal databases. This algorithm is based on the optimistic approach, which is, in our opinion, more suitable for temporal databases than the pessimistic methods. Indeed, our optimistic algorithm, in the contrary to the pessimistic ones, can exploit the temporal specifications to reduce the granule size and then to minimize the conflict degree. Moreover, it can detect, as soon as possible, all the conflict cases. By using the end of transaction marker technique, it has the merit to reduce to the maximum the period during which resources are locked in the validation phase. By carrying out a formal verification, based first on the serialization theory and next on the SPIN model checker, we have ensured that our algorithm operate correctly. Now, we proceed to its experimental evaluation vis-à-vis of other well-known concurrency control mechanisms based on an optimistic and pessimistic approach.

Published in:

Advances in Databases Knowledge and Data Applications (DBKDA), 2010 Second International Conference on

Date of Conference:

11-16 April 2010