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.
2009
2009
A routing protocol based on trusted and shortest path selection for mobile ad hoc network
A mobile ad-hoc network (MANET) is a peer-to-peer wireless network where nodes can communicate with each other without the use of… 
2005
2005
Optimizing cursor movement in holistic twig joins
Holistic twig join algorithms represent the state of the art for evaluating path expressions in XML queries. Using inverted… 
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… 
2003
2003
Evaluation of Iceberg Distance Joins
The iceberg distance join returns object pairs within some distance from each other, provided that the first object appears at… 
1998
1998
Efficient Dynamic Programming Algorithms for Ordering Expensive Joins and Selections
The generally accepted optimization heuristics of pushing selections down does not yield optimal plans in the presence of… 
1993
1993
A Parallel Sort Merge Join Algorithm for Managing Data Skew
A parallel sort-merge-join algorithm which uses a divide-and-conquer approach to address the data skew problem is proposed. 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)