Scheduling real-time transactions with disk resident data
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Priority in DBMS resource scheduling
VLDB '89 Proceedings of the 15th international conference on Very large data bases
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Current research on real-time databases
ACM SIGMOD Record
Locking protocols for concurrency control in real-time database systems
ACM SIGMOD Record
Scheduling real-time transactions using priority
Information and Software Technology
On being optimistic about real-time constraints
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Database System Concepts
Main Memory Database Research Directions
IWDM '89 Proceedings of the Sixth International Workshop on Database Machines
Scheduling Real-time Transactions: a Performance Evaluation
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Scheduling and Concurrency Control for Real-Time Database Systems
Proceedings of the 3rd International Conference on Database Systems for Advanced Applications (DASFAA)
Measured performance of a special-purpose database engine for distributed system software
Computer Communications
Hi-index | 0.00 |
Earlier performance studies of concurrency control algorithms show that in a disk-resident real-time database system, optimistic algorithms perform better than two phase locking with higher priority (2PL-HP). In a main memory real-time database system, disk I/Os are eliminated and thus more transactions are enabled to meet their real-time constraints. Lack of disk I/Os in this environment requires concurrency control be re-examined. This paper conducts a simulation study to compare 2PL-HP with a real time optimistic concurrency control algorithm (OPT-WAIT-50) for a real time main memory database system, MARS. The results show that OPT-WAIT-50 outperforms 2PL-HP with finite resources.