Summary paper, transaction processing technique is presented for real-time object-oriented databases (RTOODBs). At first, a RTOODB model is proposed. The proposed model is based on imprecise computation and an affected set of attributes so that it can provide trade-off between temporal consistency and logical consistency. Besides temporal consistency, more concurrency is also can be achieved and deadlock due to lock escalation can be reduced. Also, a real-time priority-based conflict resolution scheme is proposed. The proposed scheme has following advantages: It aborts earlier transactions whose deadlines cannot be met. It also avoids chained blocking and deadlock. In additions, if one of lock requester and lock holder must miss its deadline due to conflict access mode, the one with less work done so far is selected as a victim so that system resource is not wasted.
[1]
Hector Garcia-Molina,et al.
Scheduling real-time transactions
,
1988,
SGMD.
[2]
Vlad Ingar Wietrzyk,et al.
Real-Time Transaction Scheduling in Database Systems
,
1996,
DEXA.
[3]
Joan Peckham,et al.
RTSORAC: A Real-Time Object-Oriented Database Model
,
1994,
DEXA.
[4]
Wei-Kuan Shih,et al.
Algorithms for scheduling imprecise computations
,
1991,
Computer.
[5]
Lui Sha,et al.
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
,
1990,
IEEE Trans. Computers.
[6]
Lisa Cingiser DiPippo,et al.
Object-based semantic real-time concurrency control
,
1993,
1993 Proceedings Real-Time Systems Symposium.