Scheduling real-time transactions: a performance evaluation
ACM Transactions on Database Systems (TODS)
Data access scheduling in firm real-time database systems
Real-Time Systems - Special issue: real-time databases
Distributed and Parallel Databases - Special issue: Research topics in distributed and parallel databases
Database security
Applying update streams in a soft real-time database system
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Design and analysis of an adaptive policy for secure real-time locking protocol
Information Sciences: an International Journal
Secure transaction processing in firm real-time database systems
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
An adaptive policy for improved timeliness in secure database systems
Proceedings of the ninth annual IFIP TC11 WG11.3 working conference on Database security IX : status and prospects: status and prospects
Issues in security for real-time databases
ACM-SE 36 Proceedings of the 36th annual Southeast regional conference
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
The notions of consistency and predicate locks in a database system
Communications of the ACM
A note on the confinement problem
Communications of the ACM
Advances in real-time database systems research
ACM SIGMOD Record
Improving timeliness in real-time secure database systems
ACM SIGMOD Record
Maintaining Temporal Consistency: Pessimistic vs. Optimistic Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Integrating Security and Real-Time Requirements Using Covert Channel Capacity
IEEE Transactions on Knowledge and Data Engineering
Entity Modeling in the MLS Relational Model
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Maintaining Integrity Constraints and Security in real-Time Database Systems
Proceedings of the IFIP TC11 Working Group 11.5, Second Working Conference on Integrity and Internal Control in Information Systems: Bridging Business Requirements and Research Results
Maintaining Security in Firm Real-Time Database Systems
ACSAC '98 Proceedings of the 14th Annual Computer Security Applications Conference
The semantics and expressive power of the MLR data model
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
Supporting security requirements in multilevel real-time databases
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
Secure one snapshot protocol for concurrency control in real-time stock trading systems
Journal of Systems and Software
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
Real-time database systems can have security constraints in addition to timing constraints. Such real-time systems are typically contained in environments that exhibit hierarchical propagation of information, where mandatory access control for security is required. Conventional multilevel secure (MLS) database models that implement mandatory access control are inadequate for time-critical applications and conventional real-time database models do not address security constraints. The objective of this work is to incorporate security constraints in real-time database systems in such a way that not only is security achieved, but achieving security does not degrade real-time performance significantly in terms of deadlines missed. We present two concurrency control algorithms for secure real-time databases: the Secure two-phase locking high priority (2PLHP) algorithm is based on a two-phase locking protocol and the Secure optimistic concurrency control (OPT) algorithm uses the properties of an optimistic concurrency protocol. We implement the two algorithms and study their performance using a real-time database system simulation model. Our study covers both soft and firm real-time databases. Results show that both the algorithms perform fairly well in terms of security and timeliness compared to non-secure algorithms. We show that achieving increased security does not necessarily mean an increased sacrifice in real-time performance.