IEEE Transactions on Software Engineering
The multilevel relational (MLR) data model
ACM Transactions on Information and System Security (TISSEC)
A Performance Comparison of Two Decomposition Techniques for Multilevel Secure Database Systems
A Performance Comparison of Two Decomposition Techniques for Multilevel Secure Database Systems
Database Security-Concepts, Approaches, and Challenges
IEEE Transactions on Dependable and Secure Computing
A Formal Multilevel Database Security Model
CIS '08 Proceedings of the 2008 International Conference on Computational Intelligence and Security - Volume 02
FITME '09 Proceedings of the 2009 Second International Conference on Future Information Technology and Management Engineering
SP'88 Proceedings of the 1988 IEEE conference on Security and privacy
| Hi-index | 0.00 |
In this paper, we consider multilevel relational database system in which security classifications are assigned at the granularity of individual data elements. Usually these multilevel relations exist only at the logical level. In reality, a multilevel relation is decomposed into a collection of single-level relations which are then physically stored in a database, and then a recovery algorithm is used to reconstruct the original multilevel relation. The security considerations require that accessibility of the database must be provided at different levels of security while keeping the optimal performance of the whole system. Here we present comparative analysis of the working of SeaView decomposition and recovery algorithm, decomposition and recovery model and later novel decomposition algorithm proposed by Jojodia and Sandhu to bring out their salient features of the multilevel database systems.