Information Technology Reference
In-Depth Information
'(3$570(17
678'(17
'HSDUWPHQW
GHSDUWPHQWBQDPH
P
6WXGHQW
VWXGHQWBQDPH
KLUH
JUDGH
JUDGH
&RXUVH
FRXUVHBORFDWLRQ
Q
Q
Q
P
,16758&725
VHFWLRQ
&2856(
3URFHVV
GHSDUWPHQW
LQVWUXFWRUQDPH
LQVWUXFWRUBDGGUHVV
6HFWLRQ
&RXUSUHU
3UHUHTXLVLWH
SUHUHTXLVLWHBWLWOH
35(5(48,6,7(
Fig. 3.24 Mapped EER model for university enrollment
• Substep2isnotappliedbecauseoflackofmultiple(alternative)accesspaths
between two segments in a hierarchical database.
• Substep4,Derivationofentitiesofanm:nbinaryrelationship, is not applied.
To implement an m:n relationship in a hierarchical schema, in general, two defini-
tion trees are needed, with each segment type represented as a parent segment in one
tree, but as a child segment in another as shown below in Fig. 3.25
However, some hierarchical DBMSs provide mechanisms whereby it is possible
to define logical views on one physical storage structure. The IMS database sup-
ports m:n relationships through pair logical segments as shown in Fig. 3.26 .
Substeps 4, 5, and 6 are not applied because of lack of similar data structure in
the hierarchical schema.
 
Search WWH ::




Custom Search