It's UWAweek 42 (2nd semester, week 12)

help1402

This forum is provided to promote discussion amongst students enrolled in CITS1402 Relational Database Management Systems.

Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!"  followup message.

How do I ask a good question?
Displaying selected article
Showing 1 of 612 articles.
Currently 125 other people reading this forum.


 UWA week 35 (2nd semester, week 6) ↓
SVG not supported

Login to reply

👍?
helpful
11:49am Thu 29th Aug, Mehwish N.

Hi, First of all I did not create this question, but let's try to solve it together. Please see slides 33 if the lecture. The number of tuples in the resulting relation (after cartesian product is applied) are number of tuples in the first relation \times number of tuples in the second relation. In this case it should be 3 x 4 = 12. Also note for a simple cross product duplicates do not matter. But that answer is not there in the list. Perhaps the question is ambigious and may require filtering the tuples based on the common attributes which in this case is A. So in the 12 tuples that you get, filter out where R.A = T.A . You will only be left with 4. However, if you are doing that then it will be a join and should have a join operator / where condition, ref: slide 35. ANONYMOUS wrote:
> hi, > I was doing this question and Im a bit confused on what answer is correct.When I was doing cartesian product of A,B from R and A,C from T it gives 8 tuples.However,we can also remove the 2 repeated tuples(1222 and 2222) which will give us 6 distinct tuples.So ,would the correct answer be (c)6 or (d)8?since the condition is not specified exactly.Thank you for you help in advance!

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  8:08AM Aug 25 2024
Privacy policy