Home »
MCQs »
DBMS MCQs
DBMS Merge Join Algorithm MCQs
DBMS Merge Join Algorithm MCQs: This section contains multiple-choice questions and answers on Merge Join Algorithm in DBMS.
Submitted by Anushree Goswami, on May 14, 2022
1. A merge join is used to perform a/an ___.
- Equi-join
- Natural join
- Both A and B
- None of the above
Answer: C) Both A and B
Explanation:
A merge join is used to perform an equi-join and a natural join.
Discuss this Question
2. An algorithm called the ___ algorithm is used for performing the merge join.
- Merge
- Join
- Merge Join
- None
Answer: C) Merge Join
Explanation:
An algorithm called the Merge Join algorithm is used for performing the merge join.
Discuss this Question
3. What is ___ algorithm also known as?
- Join algorithm
- Merge algorithm
- Sort-merge-join algorithm
- None
Answer: C) Sort-merge-join algorithm
Explanation:
Merge Join algorithm is also known as Sort-merge-join algorithm.
Discuss this Question
4. We can perform a ___ join for some attribute values that are larger than the memory size.
- Block nested-loop
- Nested-loop
- Loop
- None
Answer: A) Block nested-loop
Explanation:
We can perform a block nested-loop join for some attribute values that are larger than the memory size.
Discuss this Question
5. A ___ is associated with each relation in the merge join algorithm.
- Join
- Query
- Pointer
- None
Answer: C) Pointer
Explanation:
A pointer is associated with each relation in the merge join algorithm.
Discuss this Question
6. The pointer initially points to the ____ tuple of the relation; as soon as the algorithm advances, it moves to the next one.
- Last
- First
- Middle
- Upper
Answer: B) First
Explanation:
The pointer initially points to the first tuple of the relation; as soon as the algorithm advances, it moves to the next one.
Discuss this Question
7. Even if the number of relations is large, each set of tuples must fit in memory.
- Columns
- Attributes
- Tuples
- None
Answer: C) Tuples
Explanation:
Even if the number of relations is large, each set of tuples must fit in memory.
Discuss this Question
8. Prior to applying the merge join algorithm, we must ____ the given input relations r and s if any of the join attributes are not sorted.
- Query
- Add
- Delete
- Sort
Answer: D) Sort
Explanation:
Prior to applying the merge join algorithm, we must sort the given input relations r and s if any of the join attributes are not sorted.
Discuss this Question
9. Putting ____ that share the same join attribute values consecutively is possible if the relations are sorted.
- Tuples
- Attributes
- Columns
- None
Answer: A) Tuples
Explanation:
Putting tuples that share the same join attribute values consecutively is possible if the relations are sorted.
Discuss this Question
10. Our new '_____' technique prevents ourselves from such expensive access.
- Hybrid Merge Join
- Merge Join
- Join
- None
Answer: A) Hybrid Merge Join
Explanation:
Our new 'Hybrid Merge Join' technique prevents ourselves from such expensive access.
Discuss this Question