Abstract
Real-time database applications require not only logical consistency but also data temporal consistency in order to support transactions that have to respond to outside-world events in a timely fashion. Virtually, temporal constraints represent other deadlines for the transactions. It becomes important to have an effective and efficient priority assignment mechanism co-operating with an appropriate scheduling algorithm to satisfy both time and temporal constraints. In this paper, the issues associated with temporal consistency are addressed and two new priority assignment policies are presented that can effectively help long, global transactions meet their deadlines with a much lower probability of temporal consistency violation.
Get full access to this article
View all access options for this article.