Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Quasi serializability: a correctness criterion for global concurrency control in InterBase
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Distributed and Parallel Databases - Special issue: Research topics in distributed and parallel databases
Read-only transactions in a distributed database
ACM Transactions on Database Systems (TODS)
Database System Concepts
Divergence Control for Epsilon-Serializability
Proceedings of the Eighth International Conference on Data Engineering
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Relaxed Serializability Based on Consistent States for Real-Time Database Applications
WPDRTS '96 Proceedings of the 4th International Workshop on Parallel and Distributed Real-Time Systems
Optimistic voting for managing replicated data
Journal of Computer Science and Technology
| Hi-index | 0.00 |
For real-time database systems, transaction processing must satisfy not only logical consistency constraints but also timing constraints. The conflict serializability is too restrictive to achieve the acceptable throughput and predictable response time. Moreover, 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 this paper, we classify the consistency into six forms of consistency and propose a relaxed serializability, called statewise serializability, as the weakest form of consistency in our classification. The statewise serializability alleviates the strictness of serializability by allowing for controlled inconsistent read operation. It can be properly used as a correctness criterion in real-time database applications. We also present the algorithm that determines whether the schedules are statewise serializable, and compare it to other correctness criteria.