Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,004,432 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Join (SQL)
Relational database
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Optimization of GPU-Based Main-Memory Hash Join
Guo-hua Li
,
Yuxing Ren
,
Can Luo
,
Jin Huang
,
Yangdong Deng
2017
Corpus ID: 55145504
With the advent of the big data era, highly efficient and scalable join algorithms are becoming increasingly essential for…
Expand
2016
2016
Comparison of Two Way Join Algorithms used in MapReduce Frame work for handling BigData
S. Sahu
,
L. Jena
,
Santosh Satapthy
2016
Corpus ID: 28608085
Due to the advent of new technologies, devices, and communication means like social networking sites, the amount of data produced…
Expand
2014
2014
Block Nested Join and Sort Merge Join Algorithms: An Empirical Evaluation
Mingxia Chen
,
Zhi Zhong
International Conference on Advanced Data Mining…
2014
Corpus ID: 26894119
Both block nested join algorithm and sort merge join algorithm are conventional join algorithms in database systems. To the best…
Expand
2014
2014
An Effective Energy and Latency Of Full Text Search Based On TWIG Pattern Queries Over Wireless XML
A. Rajathilak
,
A. Lalitha
2014
Corpus ID: 16826101
In wireless dissemination scheme, major issue is based on the retrieval of requested text search over internet and power is much…
Expand
2007
2007
Super Size It!!! Maximize the Performance of Your ETL Processes
Nancy Rausch
,
Nancy J. Wills
2007
Corpus ID: 110409713
The success of every business activity—from supplier management to customer service—is dependent upon how well an organization…
Expand
2007
2007
MFP : uma política eficiente de liberação de memória para o operador físico Hash-Merge Join
D. M. D. S. Albuquerque
2007
Corpus ID: 169725987
Em uma MDBC as tecnicas de processamento de consultas devem ser adaptadas para lidarem com a instabilidade do ambiente, assim…
Expand
2004
2004
XQuery Query Processing in Relational Systems
Yingwen Chen
2004
Corpus ID: 64031082
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…
Expand
2000
2000
An Improvement of Partition-Based Spatial Merge Join using Dynamic Object Decomposition
Yong-Jin Choi
,
Yong-Ju Lee
,
Ho-Hyun Park
,
Sung-Jin Lee
,
C. Chung
2000
Corpus ID: 63406993
Traditional object decomposition techniques do not decompose spatial objects dynamically during spatial joins, because the object…
Expand
1995
1995
Domain-Partitioned Parallel Sort-Merge Join
Johan Larson
1995
Corpus ID: 60705824
This thesis studies the utility of parallelizing sort-merge join in a shared-memory processing environment. The investigated…
Expand
1981
1981
Multiprocessor sort-merge join algorithm for relational data bases
W. Thompson
,
D. Ries
1981
Corpus ID: 62607053
Using multiprocessor systems for rapid processing of relational operations in relational databases is currently a topic of some…
Expand