Classification of Weak Correctness Criteria for Real-Time Database Applications
COMPSAC '96 Proceedings of the 20th Conference on Computer Software and Applications
| Hi-index | 0.00 |
Serializability that is the standard notion of correctness has limitations in real-time database systems because of its strictness of logical consistency. For certain real-time applications, serializability may not be necessary for concurrent execution and different correctness criteria may be applied to different applications depending on the semantics and the requirements of transactions in the applications. In this paper, we propose relaxed serializability, called statewise serializability, which extends the correctness criteria beyond view serializability and conflict serializability. It alleviates the strictness of serializability by allowing for controlled inconsistent read operation. We also present the algorithm that determines whether the schedules are statewise serializable. It can be properly used as a correctness criterion in real-time database applications.