Question

The ___________ merges the sorted relation with leaf entries of the secondary B+ tree index.

(a) Merge join algorithm

(b) Hybrid merge join algorithm

(c) Hash join algorithm

(d) Hybrid Hash join algorithm

The question was asked in an interview.

This interesting question is from Join and Other Operations in division Query Processing and Optimization of RDBMS

Answer 1

The correct choice is (b) Hybrid merge join algorithm

The best I can explain: The Hybrid merge join algorithm merges the sorted relation with leaf entries of the secondary B+ tree index. The result contains tuples from the sorted relation and addresses for tuples from the unsorted relation.