A Transaction Manager for Real-Time Database Systems Using Classified Queue


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 11, pp. 2751-2762, Nov. 1998
10.3745/KIPSTE.1998.5.11.2751,   PDF Download:

Abstract

In this paper, a new priority assignment policy and concurrency control for improvement of transaction predictability and performance are proposed. We present a new priority assignment algorithm called classified priority assignment(CPA), which solves the defects of Earliest Deadline First(EDF) by using class and bucket, and deals with real-time transaction and time-sharing transaction effectively. Also, we present a new concurrency control policy called conditional optimistic concurrency control using lock. It uses optimistic concurrency control for improvement of predictability, and solves transaction conflict by considering priority and execution time of transaction to waste less system resource.


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]
K. G. Bae and B. H. Young, "A Transaction Manager for Real-Time Database Systems Using Classified Queue," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 11, pp. 2751-2762, 1998. DOI: 10.3745/KIPSTE.1998.5.11.2751.

[ACM Style]
Kim Gyung Bae and Bae Hae Young. 1998. A Transaction Manager for Real-Time Database Systems Using Classified Queue. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 11, (1998), 2751-2762. DOI: 10.3745/KIPSTE.1998.5.11.2751.