Home »
MCQs »
DBMS MCQs »
DBMS Nested-Loop Join Algorithm MCQs
A block nested-loop join is worst case when blocks in the inner relation s are read ____ for each block in the outer relation r
11. A block nested-loop join is worst case when blocks in the inner relation s are read ____ for each block in the outer relation r.
- Once
- Twice
- Thrice
- Multiple times
Answer: A) Once
Explanation:
A block nested-loop join is worst case when blocks in the inner relation s are read once for each block in the outer relation r.