Consider a block nested-loop join for the two relation students and takes: | Relation | students | takes | |---|---|---| | Number of tuples(n) | 3000 | 2500 | | Number of blocks(b) | 500 | 600 | Assuming the worst-case memory availability and considering takes as the outer relation, which of the following options is/are correct?

(A) Number of block transfers require=300600

(C) Number of seeks require=1200

(B) Number of block transfers require=300500

(D) Number of seeks require=1400

Database Management Systems · End Term · 31 Aug 2025 · May 2025 term

Question 13: Consider a block nested-loop join for the two relation s…

Question 13

+2 marksOne or more correct options

Consider a block nested-loop join for the two relation students and takes:

Relation	students	takes
Number of tuples(n)	3000	2500
Number of blocks(b)	500	600

Assuming the worst-case memory availability and considering takes as the outer relation, which of the following options is/are correct?

Select all that apply.

A
Number of block transfers require=300600
B
Number of block transfers require=300500
C
Number of seeks require=1200
D
Number of seeks require=1400

Show answer

Correct answers

A
Number of block transfers require=300600
C
Number of seeks require=1200

See the whole paper Take it as a mock test

Question 13 of 20 in the IIT Madras BS Database Management Systems (DBMS) End Term paper sat on 31 Aug 2025, in the May 2025 term (IIT M DIPLOMA FN EXAM QDD1 31 Aug 2025). It carries 2 marks.

Question 13: Consider a block nested-loop join for the two relation s…

Question 13

More questions from this paper