click below
click below
Normal Size Small Size show me how
Chapter 6 - Database
| Term | Definition |
|---|---|
| one-to-many relationship | An entity in entity set A is associated with any number (zero or more) of entities in entity set B. An entity in B, however, can be associated with at most one entity in A |
| Candidate Key | A minimal superkey; that is, a key that does not contain a subset of attributes that is itself a superkey |
| recursive relationship set | the same entity set participates in a relationship set more than once, in different roles |
| Binary relationship set | a relationship between two different entities (degree of 2) |
| weak entity sets | an entity set whose existence is dependent on another entity set (its identifying entity set) |
| strong entity sets | an entity set whose existence is not dependent on the existence of other entity set |
| discriminator attributes | attributes used to uniquely identify a weak entity |
| identifying relationship | the relationship associating the weak entity set with the identifying entity set |
| specialization | the process of designating subgrouping within an entity set |
| generalization | a containment relationship that exists between a higher level entity set and one or more lower level entity sets |
| entity set | set of entities of the same type that share the same properties or attributes |
| total participation | Every member of an entity set must participate in at least one relationship |
| partial participation | It is possible that some entities in an entity set do not participate in a relationship. Each entity instance need not be included at least once in the relationship set |
| superkey | a set of one or more attributes that, taken collectively, allow us to uniquely identify a tuple in the relation |
| disjoint specialization | When an entity must belong to at most one specialized entity set (single arrow) |
| overlapping specialization | When an entity may belong to multiple specialized entity sets (two separate arrows) |