Sort-Merge Join

From open-encyclopedia.com - the free encyclopedia.

Sort-Merge Join is an example of a join algorithm and is used in the implementation of a Relational Database Management System.

Description The Sort-Merge Join algorithm works as follows. The two input relations are sorted on the join attribute. We then search through the tuples for a match. Once we have found a match we exploit the grouping of touples to read out the matching set.

This article needs cleanup.
This article needs to be edited to conform to a higher standard of article quality. After the article has been cleaned up, you may remove this message. For help, see How to Edit a Page and the style and How-to Directory . (add new)