Abstract
Many real-time database applications are deployed in safety-critical systems like military systems where enforcing security is crucial to the success of the organization. A secure real-time database system has to simultaneously satisfy two requirements - guarantee data security and minimize the number of missed transaction deadlines. Several studies [2,5,11] have investigated this non-trivial problem where tradeoffs need to be made between data security and timeliness because of the complexity involved. In this paper, we try to study the performance of three concurrency control algorithms in terms of missed deadlines and data security. We build a detailed simulation model of a firm-deadline real-time database system. Our experiments show that the optimistic approach exhibits the best overall performance and that the performance of high-security transactions is much worse than that of low-security transactions.
| Original language | English |
|---|---|
| Pages (from-to) | 383-388 |
| Number of pages | 6 |
| Journal | Proceedings of the IASTED International Conference on Modelling, Simulation, and Optimization |
| Publication status | Published - 2004 |
| Externally published | Yes |
| Event | Proceedings of the Fourth IASTED International Conference on Modelling, Simulation, and Optimization - Kauai, HI, United States Duration: 17 Aug 2004 → 19 Aug 2004 |
Keywords
- Concurrency control
- Performance evaluation
- Real-time databases
- Security
- Transaction scheduling
ASJC Scopus subject areas
- Software
- Modelling and Simulation
- Computer Science Applications