Decomposition Of Relations And Synthesis Of Entity-Relationship Diagrams

this paper is three-fold: to present a new decomposition algorithm to decompose a relation according to its functional and multivalued dependencies into well-defined primitives (atomic relations and functional dependencies) which preserve the original information, to describe the atomic relations and their functional dependencies through labelled graphs called Combined A-Z graphs which exhibit all the information in a succint a convenient diagram, (c) to indicate how the combined A-Z graphs may be transformed into Chen's Entity-Relationship diagram