Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
With the advent of the big data era, highly efficient and scalable join algorithms are becoming increasingly essential for… 
2016
2016
Due to the advent of new technologies, devices, and communication means like social networking sites, the amount of data produced… 
2014
2014
Both block nested join algorithm and sort merge join algorithm are conventional join algorithms in database systems. To the best… 
2014
2014
In wireless dissemination scheme, major issue is based on the retrieval of requested text search over internet and power is much… 
2007
2007
The success of every business activity—from supplier management to customer service—is dependent upon how well an organization… 
2007
2007
Em uma MDBC as tecnicas de processamento de consultas devem ser adaptadas para lidarem com a instabilidade do ambiente, assim… 
2004
2004
With the rapid growth of XML documents to serve as a popular and major media for storage and interchange of the data on the Web… 
2000
2000
Traditional object decomposition techniques do not decompose spatial objects dynamically during spatial joins, because the object… 
1995
1995
This thesis studies the utility of parallelizing sort-merge join in a shared-memory processing environment. The investigated… 
1981
1981
Using multiprocessor systems for rapid processing of relational operations in relational databases is currently a topic of some…