Skip to search formSkip to main contentSkip to account menu

Join (SQL)

Known as: Full outer join, Inner join sql, Cartesian join 
A SQL join clause combines columns from one or more tables in a relational database. It creates a set that can be saved as a table or used as it is… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
ACIDAlgorithmAssociative entityBitmap index

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning
High utility itemset mining is a challenging task in frequent pattern mining, which has wide applications. The state-of-the-art… 
Highly Cited
2011
Highly Cited
2011
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been… 
Highly Cited
2008
Highly Cited
2008
Relational joins on graphics processors
We present a novel design and implementation of relational join algorithms for new-generation graphics processing units (GPUs… 
Review
2008
Review
2008
Investigating farmers' preferences for the design of agri-environment schemes: a choice experiment approach
In recent decades agri-environment schemes (AES) have become an increasingly important tool for policy makers aiming to reverse… 
Highly Cited
2008
Highly Cited
2008
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints
There has been considerable interest in similarity join in the research community recently. Similarity join is a fundamental… 
Highly Cited
2006
Highly Cited
2006
A comparison of two approaches to utilizing XML in parametric databases for temporal data
Highly Cited
1994
Highly Cited
1994
Generalized Minkowski metrics for mixed feature-type data analysis
This paper presents simple and convenient generalized Minkowski metrics on the multidimensional feature space in which coordinate… 
Highly Cited
1991
Highly Cited
1991
An Evaluation of Non-Equijoin Algorithms
A non-equijoin of relations R and S is R bnnd join if the join predicate requires valnes in the join att.ribr1t.e of R 10 fall… 
Highly Cited
1990
Highly Cited
1990
Bucket Spreading Parallel Hash: A New, Robust, Parallel Hash Join Method for Data Skew in the Super Database Computer (SDC)
The Super Database Computer (SDC) is a highperformance relational database server for a joinintensive environment under… 
Highly Cited
1977
Highly Cited
1977
The theory of joins in relational data bases
Answering queries in a relational database often requires that the natural join of two or more relations be computed. However… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)