Block nested join and sort merge join algorithms: An empirical evaluation

Abstract

Both block nested join algorithm and sort merge join algorithm are conventional join algorithms in database systems. To the best of our knowledge, few literature focused on the experimentally comparing these two join algorithms. In this paper, we implement the sort merge join algorithm and the block nested loop join algorithm. And then, experimental results demonstrate the sort merge join algorithm outperforms than the block nested join algorithm on execution time in term of different bytes of page or different number of buffer but with the same result after join.