# 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 ___.

1. Equi-join
2. Natural join
3. Both A and B
4. 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.

2. An algorithm called the ___ algorithm is used for performing the merge join.

1. Merge
2. Join
3. Merge Join
4. None

Explanation:

An algorithm called the Merge Join algorithm is used for performing the merge join.

3. What is ___ algorithm also known as?

1. Join algorithm
2. Merge algorithm
3. Sort-merge-join algorithm
4. None

Explanation:

Merge Join algorithm is also known as Sort-merge-join algorithm.

4. We can perform a ___ join for some attribute values that are larger than the memory size.

1. Block nested-loop
2. Nested-loop
3. Loop
4. None

Explanation:

We can perform a block nested-loop join for some attribute values that are larger than the memory size.

5. A ___ is associated with each relation in the merge join algorithm.

1. Join
2. Query
3. Pointer
4. None

Explanation:

A pointer is associated with each relation in the merge join algorithm.

6. The pointer initially points to the ____ tuple of the relation; as soon as the algorithm advances, it moves to the next one.

1. Last
2. First
3. Middle
4. Upper

Explanation:

The pointer initially points to the first tuple of the relation; as soon as the algorithm advances, it moves to the next one.

7. Even if the number of relations is large, each set of tuples must fit in memory.

1. Columns
2. Attributes
3. Tuples
4. None

Explanation:

Even if the number of relations is large, each set of tuples must fit in memory.

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.

1. Query
3. Delete
4. 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.

9. Putting ____ that share the same join attribute values consecutively is possible if the relations are sorted.

1. Tuples
2. Attributes
3. Columns
4. None

Explanation:

Putting tuples that share the same join attribute values consecutively is possible if the relations are sorted.

10. Our new '_____' technique prevents ourselves from such expensive access.

1. Hybrid Merge Join
2. Merge Join
3. Join
4. None

Explanation:

Our new 'Hybrid Merge Join' technique prevents ourselves from such expensive access.

Preparation

What's New

Top Interview Coding Problems/Challenges!