GATEverse
← GATE CSE 2006

Q69

MCQ2 marks, −0.5

Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. Assume no null values and no foreign keys or integrity constraints. Assume that amounts 6000,7000,8000,90006000, 7000, 8000, 9000 and 1000010000 were each paid by 20%20\% of the students. Consider these query plans (Plan 1 on left, Plan 2 on right) to “list all courses taken by students who have paid more than x”

Figure 1

A disk seek takes 4ms,4ms, disk data transfer bandwidth is 300300 MB/s and checking a tuple to see if amount is greater than xx takes 10µs.10µs. Which of the following statements is correct?

Sign in to save attempts.

Loading…