Sort-merge join

Known as: Merge join, Merge scan join

The sort-merge join (also known as merge join) is a join algorithm and is used in the implementation of a relational database management system. The…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

In this paper, we study the use of Late-materialization for sort-merge join algorithm. We study various effects of using this…

2014

Every major open-source and commercial RDBMS offers some form of support for full-text search using inverted indexes. When…

2014

Both block nested join algorithm and sort merge join algorithm are conventional join algorithms in database systems. To the best…

2012

In this paper we consider the problem of mining frequently occurring interesting phrases in large document collections in an ad…

2007

Em uma MDBC as tecnicas de processamento de consultas devem ser adaptadas para lidarem com a instabilidade do ambiente, assim…

2007

The success of every business activity—from supplier management to customer service—is dependent upon how well an organization…

2001

In a fuzzy relational database where a relation is a fuzzy set of tuples and ill-known data are represented by possibility…

1996

Join processing algorithms play a critical role in efficient query processing. Popular join processing algorithms like merge join…

1993

A parallel sort-merge-join algorithm which uses a divide-and-conquer approach to address the data skew problem is proposed. The…

1991

A novel algorithm for relational equijoin is presented. The algorithm is a modification of merge join, but promises superior…