Question: 2 . Consider the following relation: Articles ( ID , title, journal, issue, year, startpage, endpage, TR - ID ) It contains information on articles

2. Consider the following relation:
Articles (ID, title, journal, issue, year, startpage, endpage, TR-ID)
It contains information on articles published in scientific journals. Each article has a unique ID, a title, and information on where to find it (name of journal, what issue, and on which pages). Also, if results of an article previously appeared in a "technical report" (TR), the ID of this technical report can be specified. We have the following information on the attributes:
- For each journal, an issue with a given number is published in a single year.
- The endpage of an article is never smaller than the startpage.
- There is never (part of) more than one article on a single page.
\begin{tabular}{|l|l|l|l|l|l|l|l|}
\hline I & Title & Journal & Issue & Year & StartPage & EndPage & TR-ID \\
\hline 42 & TCP Networks & JNN & 51 & 2004 & 121 & 138 & 87\\
\hline 33 & Sensor Nodes & JNN & 41 & 2001 & 69 & 85 & 62\\
\hline 33 & Sensor Nodes & JNN & 41 & 2001 & 69 & 85 & 56\\
\hline 39 & Deep Learning & SICOMP & 31 & 2001 & 111 & 133 & 47\\
\hline 57 & NP Problems & JA & 51 & 2008 & 1 & 3 & 99\\
\hline 77 & ANT Disease & SICOMP & 51 & 2008 & 1 & 6 & 98\\
\hline 78 & ANT Disease & NAT & 2222 & 2008 & 22 & 22 & 98\\
\hline
\end{tabular} a. Based on the above, indicate which of the following sets of attributes is a candidate key for Articles. 1.\{ID\}; 2.\{ID,TR-ID\}; 3.\{ID,title,TR-ID \}
[2 mark]
b. Based on the above, indicate for each of the following potential functional dependencies, whether it is indeed an FD or not.
i. ID -> title;
ii. startpage -> endpage;
iii. journal, issue -> year
iv. title -> ID
v. ID -> startpage, endpage, journal, issue
vi. TR-ID -> ID
[6 marks]
c. Explain whether or not the Articles relation is in 1 NF .
[2 mark]
d. Perform normalization into 3 NF and state the resulting relations.
[5 marks]
2 . Consider the following relation: Articles (

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!