Dynamic adjustment of serialization order using time-stamp intervals in real-time databases

Although an optimistic approach has been shown to be better than locking protocols for real-time database systems (RTDBS), it has the problems of unnecessary restarts and heavy restart overhead. In this paper we propose a new optimistic concurrency control protocol called OCC-DATI. In OCC-DATI the number of transaction restarts is minimized by dynamic adjustment of the serialization order of the conflicting transactions. The need for dynamic adjustment of the serialization order is checked and the serialization order is updated in the validation phase. This provides more freedom to adjust the serialization order of conflicting transactions. OCC-DATI has several advantages over other optimistic concurrency control protocols. The protocol maintains all the nice properties with forward validation, a high degree of concurrency freedom front deadlock, and early detection and resolution of conflicts, resulting in both fewer wasted resources and a smaller number of restarts. All of these are important to the performance of RTDBSs and contribute to greater chances of meeting transaction deadlines. Performance studies of our protocol have been carried out in RTDBS and the results confirm that the performance of the OCC-DATI is better than other well-known OCC protocols.

[1]  Donald F. Towsley,et al.  Experimental evaluation of real-time transaction processing , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[2]  Tei-Wei Kuo,et al.  Application semantics and concurrency control of real-time data-intensive applications , 1992, [1992] Proceedings Real-Time Systems Symposium.

[3]  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.

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

[5]  Marc H. Graham How to get serializability for real-time transactions without having to pay for it , 1993, 1993 Proceedings Real-Time Systems Symposium.

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

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

[8]  Jan Lindström,et al.  Benchmark for Real-Time Database Systems for Telecommunications , 2001, Databases in Telecommunications.

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

[10]  Hector Garcia-Molina,et al.  Scheduling real-time transactions: a performance evaluation , 1988, TODS.

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

[12]  K.-J. Lin,et al.  Consistency issues in real-time database systems , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track.

[13]  Calton Pu,et al.  A Formal Characterization of Epsilon Serializability , 1995, IEEE Trans. Knowl. Data Eng..

[14]  John A. Stankovic,et al.  On real-time transactions , 1988, SGMD.

[15]  Juha Taina,et al.  Evaluation of Database Architectures for Intelligent Networks , 1995 .

[16]  Tei-Wei Kuo,et al.  SSP: A semantics-based protocol for real-time data access , 1993, 1993 Proceedings Real-Time Systems Symposium.

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

[18]  Kwok-Wa Lam,et al.  A priority ceiling protocol with dynamic adjustment of serialization order , 1997, Proceedings 13th International Conference on Data Engineering.

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

[20]  Miron Livny,et al.  On being optimistic about real-time constraints , 1990, PODS '90.

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

[22]  Mukesh Singhal,et al.  Issues and approaches to design of real-time database systems , 1988, SGMD.

[23]  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.

[24]  Juha Taina,et al.  An Experimental Real-Time Object-Oriented Database Architecture for Intelligent Networks , 1996 .

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

[26]  K. Raatikainen,et al.  Real-Time Databases in Telecommunications , 1997 .

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

[28]  Juhnyoung Lee Concurrency control algorithms for real-time database systems , 1994 .

[29]  Prabhudev Konana,et al.  Updating Timestamp Interval for Dynamic Adjustment of Serialization Order in Optimistic Concurrency Control-Time Interval (OCCTI) Protocol , 1997, Inf. Process. Lett..

[30]  Kwei-Jay Lin,et al.  Enhancing external consistency in real-time transactions , 1996, SGMD.

[31]  Lui Sha,et al.  Modular Concurrency Control and Failure Recovery , 1988, IEEE Trans. Computers.