Priority Assignment in Distributed Real-time Databases Supporting Temporal Consistency

Authors:
Victor C. S. Lee;Kam-Yiu Lam;Sheung-Lun Hung
Affiliations:
Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong
Venue:
Integrated Computer-Aided Engineering
Year:
1998

Citing 11
Cited 0

Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
Scheduling real-time transactions: a performance evaluation

ACM Transactions on Database Systems (TODS)
Real-time databases

Distributed and Parallel Databases - Special issue: Research topics in distributed and parallel databases
Advances in real-time systems

Advances in real-time systems
Predictability and consistency in real-time database systems

Advances in real-time systems
Applying update streams in a soft real-time database system

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Enhancing external consistency in real-time transactions

ACM SIGMOD Record
Maintaining Temporal Consistency: Pessimistic vs. Optimistic Concurrency Control

IEEE Transactions on Knowledge and Data Engineering
Supporting predictability in real-time database systems

RTAS '96 Proceedings of the 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96)
A semantic-based concurrency control protocol for real-time transactions

RTAS '96 Proceedings of the 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96)
Impact of priority assignment on optimistic concurrency control in distributed real-time databases

RTCSA '96 Proceedings of the Third International Workshop on Real-Time Computing Systems Application

Quantified Score

Hi-index	0.00

Visualization

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.