recategorized
1,111 views
2 votes
2 votes

A many-to-one relationship exists between entity sets $r_1$ and $r_2$. How will it be represented using functional dependencies if $Pk(r)$ denotes the primary key attribute of relation $r$?

  1. $Pk(r_1) \rightarrow Pk(r_2)$
  2. $Pk(r_2) \rightarrow Pk(r_1)$
  3. $Pk(r_2) \rightarrow Pk(r_1) \text{ and } Pk(r_1) \rightarrow Pk(r_2)$
  4. $Pk(r_2) \rightarrow Pk(r_1) \text{ or } Pk(r_1) \rightarrow Pk(r_2)$
recategorized

4 Answers

2 votes
2 votes

Answer: $A$

$Pk(r)$ denotes the primary key attribute of relation $r$.

• The functional dependency $Pk(r_1) \rightarrow  Pk(r_2)$ indicates a many-to-one relationship between $r_1,r_2,$ since any $r_1$ value which is repeated will have the same $r_2$ value, but many $r_1$ values may have the same $r_2$ value.

NOTE:

Consider the statement:

  1. A many-to-one relationship set exists between entity sets student and instructor.
  2. A many-to-one relationship set exists between entity sets instructor and student.

Read the above statements & think about what do they mean.

Statement 1 says that “one instructor may have many students, but one student learns from at most one instructor”.

Statement 2 says that “one student may have many instructors, but one instructor teaches at most one student”.


Source of this UGC NET Question: Korth DBMS Book.

https://www.db-book.com/db6/practice-exer-dir/8s.pdf   (Page 10)

http://web.cs.ucla.edu/classes/fall04/cs143/solutions/ch7.pdf (Page 86)

Same Question here:

https://gateoverflow.in/335229/ugc-net-cse-january-2017-part-3-question-9 

1 votes
1 votes

Many to One relation btw entity sets r1 and r2

 

I) assume r1 is left side of relation and r2 is right side of relation.

many entities of r1 connected to one entity of r2

A  ---------->   1

B  ---------->   1

C  ---------->   1

D   ---------->   2

E  ---------->   3

by knowing the entity of r1, you can say what is entity of r2 ===> pk(r1) → pk(r2)

by knowing the entity of r2, you can not say what is entity of r1 ===> pk(r2)  → pk(r1) is not hold

pk(r1) → pk(r2) ===> Answer should be A


II) assume r2 is left side of relation and r1 is right side of relation.

many entities of r2 connected to one entity of r1

A  ---------->   1

B  ---------->   1

C  ---------->   1

D   ---------->   2

E  ---------->   3

by knowing the entity of r2, you can say what is entity of r1 ===> pk(r2) → pk(r1)

by knowing the entity of r2, you can not say what is entity of r1 ===> pk(r1)  → pk(r2) is not hold

pk(r2) → pk(r1) ===> Answer should be B

0 votes
0 votes
B is the right Answer
edited by
Answer:

Related questions

0 votes
0 votes
5 answers
1
Pooja Khatri asked Jul 13, 2018
2,296 views
In RDBMS, which type of Join returns all rows that satisfy the join condition?Inner JoinOuter JoinSemi JoinAnti Join
0 votes
0 votes
5 answers
4
Pooja Khatri asked Jul 13, 2018
4,674 views
In a Hierarchical database, a hashing function is used to locate the ____CollisionRootForeign KeyRecords