Using importance of transactions and optimistic concurrency control in firm real-time databases

In a real-time database system, it is difficult to meet all of the timing constraints due to the consistency requirements of the underlying database. However, when the transactions in the system are heterogeneous, they are not all of the same importance-some are of greater importance than others. In this paper, we propose a new protocol called OCC-PDATI (Optimistic Concurrency Control Protocol using Dynamic Adjustment of serialization order and Transaction Importance), which uses information about the importance of the transactions in the conflict resolution. Performance studies of our protocol have been carried out in a prototype real-time database system. The results clearly indicate that OCC-PDATI meets the goal of favoring transactions of high importance.

[1]  Kimmo E. E. Raatikainen,et al.  Dynamic adjustment of serialization order using time-stamp intervals in real-time databases , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).

[2]  J. T. Robinson,et al.  On optimistic methods for concurrency control , 1979, TODS.

[3]  Kwok-Wa Lam,et al.  An Efficient Real-time Optimistic Concurrency Control Protocol , 1995, ARTDB.

[4]  Sang Hyuk Son,et al.  A Study of Concurrency Control in Real-Time, Active Database Systems , 2002, IEEE Trans. Knowl. Data Eng..

[5]  Sang Hyuk Son,et al.  Using dynamic adjustment of serialization order for real-time database systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[6]  Daniel A. Menascé,et al.  Optimistic versus pessimistic concurrency control mechanisms in database management systems , 1982, Inf. Syst..

[7]  K. Raatikainen,et al.  A real-time database for future telecommunication services , 1997 .

[8]  Vijay Kumar,et al.  A Study of Priority Cognizance in Conflict Resolution for Firm Real-Time Database Systems , 1997, RTDB.

[9]  L. DiPippo,et al.  Real-Time Databases , 1995 .

[10]  Kwok-Wa Lam,et al.  Real-time optimistic concurrency control protocol with dynamic adjustment of serialization order , 1995, Proceedings Real-Time Technology and Applications Symposium.

[11]  Irving L. Traiger,et al.  The notions of consistency and predicate locks in a database system , 1976, CACM.

[12]  Miron Livny,et al.  Dynamic real-time optimistic concurrency control , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[13]  Intelligent Networks and Intelligence in Networks , 1997, IFIP — The International Federation for Information Processing.

[14]  Kimmo E. E. Raatikainen.  Information Aspects of Services and Service Features in Intelligent Network Capability Set 1 , 1994 .

[15]  Kimmo E. E. Raatikainen,et al.  Transaction Processing in the RODAIN Real-Time Database System , 1997, RTDB.

[16]  Kimmo E. E. Raatikainen,et al.  A Distributed Real-Time Main-Memory Database for Telecommunication , 1999, Databases in Telecommunications.

[17]  Donald F. Towsley,et al.  Experimental Evaluation of Real-Time Optimistic Concurrency Control Schemes , 1991, VLDB.

[18]  Sang Hyuk Son,et al.  Performance of Concurrency Control Algorithms for Real-Time Database Systems , 1996, Performance of Concurrency Control Mechanisms in Centralized Database Systems.

[19]  Philip S. Yu,et al.  On real-time databases: concurrency control and scheduling , 1994, Proc. IEEE.

[20]  Krithi Ramamritham,et al.  The integration of deadline and criticalness in hard real-time scheduling , 1988, Proceedings. Real-Time Systems Symposium.