On Real Time Databases: Concurrency Control and Scheduling

In addition to maintaining database consistency as in conventional databases. real time database systems must also handle transactions with timing constraints. While transaction response time and throughput are usually used to measure a conventional database system, the percentage of transactions satisfying the deadlines or a time-critical value function is often used to evaluate a real time database system. Scheduling real time transactions is far more complex than traditional real time scheduling in the sense that 1) worst case execution times are typically hard to estimate, since not only CPU but also I/O requirement is involved; and 2) certain aspects of concurrency control may not integrate well with real time scheduling. In this paper, we first develop a taxonomy of the underlying design space of concurrency control including the various techniques for achieving serializability and improving performance. This taxonomy provides us with a foundation for addressing the real time issues. We then consider the integration of concurrency control with real time requirements. The implications of using run policies to better utilize real time scheduling in a database environment are examined. Finally, as timing constraints may be more important than data consistency in certain hard real-time database applications, we also discuss several approaches that explore the nonserializable semantics of real time transactions to meet the hard deadlines. © 1994 IEEE