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
2002
Highly Cited
2002
Efficient temporal join processing using indices
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has… 
Highly Cited
1998
Highly Cited
1998
Enzymatic Ligation Reactions of DNA "Words" on Surfaces for DNA Computing
The enzymatic manipulation of sets of short, 16-base oligonucleotides, or DNA “words”, is demonstrated with applications toward… 
Highly Cited
1996
Highly Cited
1996
Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates
Current data models like the NF2 model and object-oriented models support set-valued attributes. Hence, it becomes possible to… 
Highly Cited
1993
Highly Cited
1993
Fixed-precision estimation of join selectivity
We compare the performance of sampling-based procedures for estimation of the selectivity of an equijoin. While some of the… 
1991
1991
The integration of application and system based metrics in a parallel program performance tool
The IPS-2 parallel program measurement tools provide performance data from application programs, the operating system, hardware… 
Highly Cited
1989
Highly Cited
1989
Hash-Based and Index-Based Join Algorithms for Cube and Ring Connected Multicomputers
The authors compare the performance of two join algorithms on both cube and ring interconnections for message-based… 
Highly Cited
1986
Highly Cited
1986
A state transition model for distributed query processing
A state transition model for the optimization of query processing in a distributed database system is presented. The problem is… 
Highly Cited
1985
Highly Cited
1985
A fault-tolerant scheme for multistage interconnection networks
A scheme is proposed to e n h a n c e the fault-tolerance of multistage interconnection networks which only have a unique path… 
Highly Cited
1981
Highly Cited
1981
Recursive isomorphism types of recursive Boolean algebras
A Boolean algebra is recursive if B is a recursive subset of the natural numbers N and the operations ∧ (meet), ∨ (join), and… 
Highly Cited
1975
Highly Cited
1975
Computing joins of relations
Little has appeared on the problems of efficiently storing, accessing, and manipulating relations. These are of considerable… 
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)