A Proposal on Data Priority Based Transaction Scheduling Algorithm and the Comparative Performance Evaluation in Real Time Database Management System


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 3, No. 4, pp. 803-816, Jul. 1996
10.3745/KIPSTE.1996.3.4.803,   PDF Download:

Abstract

It is possible to prevent deadblock if the priority which is conventionally given to transactions is endowed to data items and the transaction with the highest priority among transactions accessing the data item is allowed to proceed. Based on this observation, we proposed a Data-Priority Based Locking Protocol(DPLP) and evaluated its performance against known locking protocols in Real Time Database Management, conflict ratio and restart ratio. In these simulation we verified that the proposed DPLP performs better than the other protocols.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
Y. S. Hwan, L. J. Young, P. C. Hang, "A Proposal on Data Priority Based Transaction Scheduling Algorithm and the Comparative Performance Evaluation in Real Time Database Management System," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 3, no. 4, pp. 803-816, 1996. DOI: 10.3745/KIPSTE.1996.3.4.803.

[ACM Style]
Yoon Seok Hwan, Lee Jae Young, and Park Chee Hang. 1996. A Proposal on Data Priority Based Transaction Scheduling Algorithm and the Comparative Performance Evaluation in Real Time Database Management System. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 3, 4, (1996), 803-816. DOI: 10.3745/KIPSTE.1996.3.4.803.