CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Timestamp-Ordering Protocol for Concurrent Transactions - A Performance Study

Published on December 2014 by Sunil Dhondu Mone
journal_cover_thumbnail

National Conference on Emerging Trends in Computer Technology
Foundation of Computer Science USA
NCETCT - Number 1
December 2014
Authors: Sunil Dhondu Mone
145aadd1-7917-444f-b689-5156e6a7aa93

Sunil Dhondu Mone . Timestamp-Ordering Protocol for Concurrent Transactions - A Performance Study. National Conference on Emerging Trends in Computer Technology. NCETCT, 1 (December 2014), 24-26.

@article{
author = { Sunil Dhondu Mone },
title = { Timestamp-Ordering Protocol for Concurrent Transactions - A Performance Study },
journal = { National Conference on Emerging Trends in Computer Technology },
issue_date = { December 2014 },
volume = { NCETCT },
number = { 1 },
month = { December },
year = { 2014 },
issn = 0975-8887,
pages = { 24-26 },
numpages = 3,
url = { /proceedings/ncetct/number1/19081-4012/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 National Conference on Emerging Trends in Computer Technology
%A Sunil Dhondu Mone
%T Timestamp-Ordering Protocol for Concurrent Transactions - A Performance Study
%J National Conference on Emerging Trends in Computer Technology
%@ 0975-8887
%V NCETCT
%N 1
%P 24-26
%D 2014
%I International Journal of Computer Applications
Abstract

When we have multiple transactions to execute at an instance, one can prefer to execute them concurrently, which result in improve throughput, improve resource utilization, reduce waiting time, and also help to reduce average response time. While transaction get executed concurrently, in get facilitate by concurrency schemes, numerous concurrency schemes has been proposed. The minimum criteria they are expected to fulfill are like serializability. To test performance of various concurrency schemes various criteria may be consider. In this paper I am considering time stamp ordering protocol and criteria like conflict serializability, view serializability, recoverability, and cascadeless, deadlock, level of concurrency support.

References
  1. Abraham Silberrschatz, H. F. (2006). Database System Concepts Fifth Edition. NY 10020: McGrawHill.
  2. Akil Kumar, M. S. (n. d. ). Performance Evaluation of Operating System Transaction Manager. University of California, Berkeley, Ca 94720.
  3. Date. (n. d. ). An Introduction to Database System, 7th Edition. Pearson Education.
  4. Gehrke, R. R. (n. d. ). Database Management System, Third Edition. McGraw Hill.
  5. Ramez Elmasri, S. B. (2007). Fundamental of Database System, Fifth Edition. Pear Publication.
  6. RL, L. S. (1996). A multigranularity locking model of concurrency control in OODB. IEEE, Transaction on Knowlede and Data Engg. 8(1), 144-156.
  7. Stonebraker, M. J. (n. d. ). The performance of Concurrency Control Algorithms fo Database Management Systems. Singapore: Proceddings of Tenth International Conference on Vary large Databse.
Index Terms

Computer Science
Information Sciences

Keywords

Consistency. Serializability Conflict Serializability View Serializability Recoverability Cascadeless