| Term 
 | Definition 
 | 
        |  | 
        
        | Term 
 | Definition 
 
        | 
Mapping EER to Codaysl or relational database schemaMapping of an OOP to relational database schemaMapping of OOP to OOP database schem |  | 
        |  | 
        
        | Term 
 | Definition 
 | 
        |  | 
        
        | Term 
 | Definition 
 
        | 
Create record for every entity typeCreate a seperate secord type for a weak entity typeCreate a set type for every binary 1:n relationship typeCreate a set type for every binary 1:1 relationship typeCreate extra dummy record for every binary n:m relationshipCreate extra dummy record for every recursive relationship typeCreate extra dummy record type for a ternary relationship typeCreate record type for super class that becomes owner in set types with subclasses as members: cannot guarantee that each set contains 1 member and cannot indicate specialtisation |  | 
        |  | 
        
        | Term 
 | Definition 
 
        | 
For each entity type create a relation that includes all the simple attributesInclude only simple component attributes of composite attributeChoose one of the key attributes as primary key if chosen key is compiste the set of simple attributes that form it will make the primary key |  | 
        |  | 
        
        | Term 
 | Definition 
 
        | 
For weak entity types W with owner entity type E, create relation R that includes all the simple attributes of W.Include as foreign key attributes of R the primary key attributes of the relationThe primary key of R is the combination of the primary key of the owner and the partial key of the weak entity type W |  | 
        |  | 
        
        | Term 
 | Definition 
 
        | 
For each binary 1:1 relationship type R indentify the relations S and T that correspond to the entity types participating in RChoose one of the relations S, and include as foreign key in S the primary key of TBetter to chose an entity type with total participation in R in the role of SInclude all the simple attrbutes of the 1:1 relationship type R as attribute of S |  | 
        |  | 
        
        | Term 
 | Definition 
 
        | 
For each binary 1:N relationship type R identify the relation S that repersents the participation entity type at the N-side of the relationship typeInclud as foreign key in S the primary key of the relation T that repersents the other enttity type praticipating in R.Include all the simple attributes of the 1:N relationship type as attributes of S. |  | 
        |  | 
        
        | Term 
 | Definition 
 
        | 
For each binary M:N relationship type R create a new relation S to repersent RInclude as foreign key attrivutes in S the primary keys of the relations that repersent the participating entity types;Include all the simple attributes of the M:N relationship type as attributes of S |  | 
        |  | 
        
        | Term 
 | Definition 
 
        | 
For each multivalued attribute A create a new relation RR will include attribute of A plus the primary key attribute k as the foreign key in Rprimary key of R is the combination of A and Kif multivalued is composite include simple components |  | 
        |  | 
        
        | Term 
 | Definition 
 
        | 
For each n-ary relationship R where n>2 create new relation S to repersent RInclude as foreign key attributes in S the primary keys of the relations that represent the participating entity typesinclude any simple attributes of relationship type as attribute of Sprimary key of S is usually a combination of all the foreign keys that reference the relations repersenting the participation entity types if cardinatlity constraints on any of the enitty types R participating in R is 1 then primary key of S should not include the foreign key attrbute that references relation E' corresponding to E |  | 
        |  | 
        
        | Term 
 
        | Model Limitations(Example model) |  | Definition 
 
        | 
Cannot guarentee that a manager of a department also works in the departmentcannot guarentee that employees should work on projects assigned to their departmentscannot guarantee that a department has at minimum on employeethe same employee can manage multiple department |  | 
        |  |