Please use this identifier to cite or link to this item:
|Title:||. PERFORMANCE STUDY OF OPTIMISTIC CONCURRENCY CONTROL 'SCHEMES FOR REAL - TIME DATABASE SYSTEMS|
|Keywords:||ELECTRONICS AND COMPUTER ENGINEERING;OPTIMISTIC CONCURRENCY CONTROL SCHEMES;REAL-TIME DATABASE SYSTEMS;CONCURRENCY CONTROL|
|Abstract:||The concurrency control problem in database systems has been examined by many people and several concurrency control schemes have been proposed. The most popular schemes are two-phase locking and optimistic schemes. Concurrency control schemes have the responsibility to ensure that, although transactions are executed concurrently with interleaving operations, the committed transaction can be ordered so that the net effect on the database is equivalent to the execution of these transactions in a serialized order. Real-time transaction processing systems are becoming increasingly important in a wide area of applications. A real-time database system is a database system where transactions have explicit timing constraints such deadline. Concurrency control is one of the main issues in the study of real-time database system. In addition to satisfying the consistency requirement, . as in traditional database systems, 'real-time transaction processing system must also satisfy timing constraints. One example of real-time database system is program trading- in stock market. Other applications of real-time database system can be found in computer-integrated manufacturing system, radar tracking systems, command and control systems and air traffic control systems. Due to its potential for a high degree, of parallelism optimistic concurrency control-is expected to give good performance in real-time database systems. In this work we study the performance of the three optimistic CC schemes in real-time databases (1) OCC-Forward Validation, (2) OCC'Optimistic Sacrifice and (3).00C- Abort50. All the three schemes use forward validation methods of OCC, but, differ in how priorities have been incorporated into their conflict resolution mechanisms. We have also investigated the performance gain by considering database items to be memory resident, through simulation experiment by taking miss percentage and restart count as measuring parameters.|
|Research Supervisor/ Guide:||Sarje, A. K.|
|Appears in Collections:||MASTERS' THESES (E & C)|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.