By Topic

A `natural' decomposition of multi-level relations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
F. Cuppens ; ONERA-CERT, Toulouse, France ; K. Yazdanian

It is shown that the analysis of functional dependencies is useful when one wants to decompose a multilevel relation in a collection of single-level relations. The decomposition of a multilevel relation into a collection of fourth normal form (4NF) relations according to various functional dependencies is studied. These decompositions are compared to the decomposition algorithms in single-level relations proposed by the Sea View project and by S. Jajodia and R. Sandhu (IEEE Symp. on Security & Privacy, 1991). It appears that the first step of the decomposition algorithms is simply the normalization of the multilevel relation in 3NF (or in 4NF). The authors propose an analysis of functional dependencies that seem natural from a semantical point of view. A multilevel relation is decomposed into 4NF relations according to these functional dependencies, and it is then shown how to decompose these relations into single-level relations. It is thought this analysis provides a good solution to the polyinstantiation problem and that it would lead to correct definitions of update operations

Published in:

Research in Security and Privacy, 1992. Proceedings., 1992 IEEE Computer Society Symposium on

Date of Conference:

4-6 May 1992