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.
2015
2015
Scalable SimRank join algorithm
Similarity join finds all pairs of objects (i, j) with similarity score s(i, j) greater than some specified threshold θ. This is… 
Highly Cited
2005
Highly Cited
2005
The threshold join algorithm for top-k queries in distributed sensor networks
In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for… 
Highly Cited
2004
Highly Cited
2004
Experimental evidence on partitioning in parallel data warehouses
Parallelism can be used for major performance improvement in large Data warehouses (DW) with performance and scalability… 
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… 
Highly Cited
1987
Highly Cited
1987
Design and evaluation of parallel pipelined join algorithms
The join operation is the most costly operation in relational database management systems. Distributed and parallel processing… 
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
1984
Highly Cited
1984
Optimization of Distributed Tree Queries
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)