Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relations R1 and R2 can be expressed as follows :
pk(R1) → pk(R2)
A relationship between two entity sets can be written as a functional dependency between their primary keys (Silberschatz). In a many-to-one relationship from R1 to R2, many tuples of R1 may be associated with the same tuple of R2, but each tuple of R1 is associated with at most one tuple of R2.
Since a given R1 tuple determines exactly one associated R2 tuple, the primary key of R1 functionally determines the primary key of R2: pk(R1) → pk(R2). This is also why, when the relationship is mapped to tables, the primary key of R2 is placed as a foreign key on the many side, R1.
pk(R2) → pk(R1) describes the opposite direction, a many-to-one relationship from R2 to R1. The dependencies whose right side is R1 ∩ R2 describe the common attributes of the two schemas, which is the lossless-join condition for a decomposition, not a mapping cardinality between the relations.
pk(R1) → pk(R2) option is correct.
What kind of mechanism is to be taken into account for converting a weak entity set into strong entity set in entity-relationship diagram ?
Which of the following provides the best description of an entity type ?
Let \(E_{1}\) and \(E_{2}\) be two entities in E-R diagram with simple single valued attributes. \(R_{1}\) and \(R_{2}\) are two relationships between \(E_{1}\) and \(E_{2}\) where \(R_{1}\) is one - many and \(R_{2}\) is many - many. \(R_{1}\) and \(R_{2}\) do not have any attribute of their own. How many minimum number of tables are required to represent this situation in the Relational Model ?
Which of the following statements is FALSE about weak entity set ?
For a weak entity set to be meaningful, it must be associated with another entity set in combination with some of their attribute values, is called as :
Specialization Lattice stands for
The values of the attributes in a database describe a particular _______.
Which of the following data item is not broken down into smaller units is?
Which of the following statements is/are TRUE?
(i) A weak entity set is identified solely by its partial key (discriminator).
(ii) The identifying relationship type between a weak entity type and its owner entity type must have total participation from the weak entity type.