A formal approach to recovery by compensating transactions
Proceedings of the sixteenth international conference on Very large databases
Distributed and Parallel Databases - Special issue: Research topics in distributed and parallel databases
The Performance of an Efficient Distributed Synchronization and Recovery Algorithm
The Journal of Supercomputing
Multiclass Query Scheduling in Real-Time Database Systems
IEEE Transactions on Knowledge and Data Engineering
Cost of Distributed Deadlock Detection: A Performance Study
Proceedings of the Sixth International Conference on Data Engineering
Asynchronous Operations in Distributed Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Using Separate Algorithms to Process Read-Only Transactions in Real-Time Systems
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Asynchronous Backup and Initialization of a Database Server for Replicated Database Systems
The Journal of Supercomputing
| Hi-index | 0.00 |
A real-time database system supports a mix of transactions. These include the real-time transactions that require completion by a given deadline. At the support side, existing concurrency control procedures introduce delays due to non-availability of data resources. The present study makes an effort to introduce a higher level of parallelism for execution of real-time transactions. It considers simple extensions within a transaction processing system. These permit a real-time transaction to avoid delays due to ordinary transactions. These also eliminate elements of other unpredictable delays, due to deadlocks or simple waiting for data resources. Thus, the investigated procedures can perform critical functions in parallel to process time-critical transactions. In effect, it is a model of transaction execution that permits execution of real-time transactions without interference from other executing transactions, and by reducing other probabilistic delays.