E.2 Tree-Structure Diagrams 9 Turner has account A-305,which was last accessed on 10 June 2009 Note that two different accounts can be accessed on the same date,as were accounts A-102 and A-305.These accounts belong to two different customers,so the access date record must be replicated to preserve the hierarchy. If the relationship depositor were one to one with the attribute date,then the transformation algorithm would be similar to the one described.The only difference would be that the two links customer date and date account would be one-to-one links. Assume that the relationship depositor is many to many with the attribute access date;here again,we can choose among a number of alternative transfor- mations.We shall use the most general transformation;it is similar to the one applied to the case where the relationship depositor has no descriptive attribute. The record types customer,account,and access date need to be replicated,and two separate tree-structure diagrams must be created,as in Figure E.10.A sample database corresponding to this schema is in Figure E.11. Until now,we have considered only binary relationships.We shift our at- tention here to general relationships.The transformation of E-R diagrams cor- responding to general relationships into tree-structure diagrams is complicated. branch branch_name branch_city assets customer account customer_name CAB account_balance customer_street balance customer_city (a)E-R diagram branch_name branch_city assets branch_name branch_city assets branch branch customer_name customer_streef customer_city account_number balance account account_number balance customer_name customer_street customer_city customer (b)Tree structure diagrams Figure E.12 E-R diagram and its corresponding tree-structure diagrams.E.2 Tree-Structure Diagrams 9 • Turner has account A-305, which was last accessed on 10 June 2009. Note that two different accounts can be accessed on the same date, as were accounts A-102 and A-305. These accounts belong to two different customers, so the access date record must be replicated to preserve the hierarchy. If the relationship depositor were one to one with the attribute date, then the transformation algorithm would be similar to the one described. The only difference would be that the two links customer date and date account would be one-to-one links. Assume that the relationship depositor is many to many with the attribute access date; here again, we can choose among a number of alternative transfor￾mations. We shall use the most general transformation; it is similar to the one applied to the case where the relationship depositor has no descriptive attribute. The record types customer, account, and access date need to be replicated, and two separate tree-structure diagrams must be created, as in Figure E.10. A sample database corresponding to this schema is in Figure E.11. Until now, we have considered only binary relationships. We shift our at￾tention here to general relationships. The transformation of E-R diagrams cor￾responding to general relationships into tree-structure diagrams is complicated. Figure E.12 E-R diagram and its corresponding tree-structure diagrams