Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.