An Improvement of the Block Nested Loop Algorithm with Multiple Block Transfers

In this paper, the approach that has been introduced is an extended version of the block nested loop algorithm that makes the join operation of the two relations more efficient by transferring the multiple blocks of both the relations into the main memory in one scan. In block nested loop, the relations which are involved in the joining process are transferred as blocks into the main memory from the hard disk. Generally, it transfers multiple blocks of outer relation and one block of inner relation into the main memory in one scan. The approach that has been introduced here, transfers multiple blocks of both the relations into the main memory in one scan. According to the new approach, processing a join query within the block nested loop algorithm has become more efficient since the number of block transfers has been reduced by transferring multiple blocks of both the relations into the main memory in one scan.