Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,136,820 papers from all fields of science
Search
Sign In
Create Free Account
Join (SQL)
Known as:
Full outer join
, Inner join sql
, Cartesian join
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ACID
Algorithm
Associative entity
Bitmap index
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
A Global Relaxation Labeling Approach to Coreference Resolution
Emili Sapena
,
Lluís Padró
,
J. Turmo
International Conference on Computational…
2010
Corpus ID: 2731424
This paper presents a constraint-based graph partitioning approach to coreference resolution solved by relaxation labeling. The…
Expand
2003
2003
Evaluation of Iceberg Distance Joins
Yutao Shou
,
N. Mamoulis
,
H. Cao
,
Dimitris Papadias
,
D. Cheung
International Symposium on Spatial and Temporal…
2003
Corpus ID: 44538208
The iceberg distance join returns object pairs within some distance from each other, provided that the first object appears at…
Expand
2003
2003
Bitmap techniques for optimizing decision support queries and association rule algorithms
Xiaohua Hu
,
T. Lin
,
E. Louie
Seventh International Database Engineering and…
2003
Corpus ID: 37686516
In this paper, we discuss some new bitmap techniques for optimizing decision support queries and association rule algorithm. We…
Expand
2002
2002
Assessing Information Quality for the Composite Relational Operation Join
Amir Parssian
,
S. Sarkar
,
V. Jacob
MIT International Conference on Information…
2002
Corpus ID: 7236899
Information plays an increasingly important role in strategic decision-making processes within businesses. Therefore, information…
Expand
2001
2001
Community assembly and the emergence of ecosystem pattern
S. Levin
,
J. Dushoff
,
J. Keymer
2001
Corpus ID: 67758992
A fundamental problem challenging natural scientists is to understand how macroscopic patterns, such as population abundance…
Expand
1998
1998
Efficient Dynamic Programming Algorithms for Ordering Expensive Joins and Selections
W. Scheufele
,
G. Moerkotte
International Conference on Extending Database…
1998
Corpus ID: 17680292
The generally accepted optimization heuristics of pushing selections down does not yield optimal plans in the presence of…
Expand
Highly Cited
1987
Highly Cited
1987
Design and evaluation of parallel pipelined join algorithms
J. Richardson
,
Hongjun Lu
,
K. Mikkilineni
ACM SIGMOD Conference
1987
Corpus ID: 15786382
The join operation is the most costly operation in relational database management systems. Distributed and parallel processing…
Expand
1985
1985
The Equi-Join Operation on a Multiprocessor Database Machine: Algorithms and the Evaluation of their Performance
G. .. Qadah
International Workshop on Database Machines
1985
Corpus ID: 8149454
The equi-join operation is one of the most important operations of the relational data model. It participates in all queries…
Expand
Highly Cited
1985
Highly Cited
1985
A fault-tolerant scheme for multistage interconnection networks
N. Tzeng
,
P. Yew
,
Chuanqi Zhu
International Symposium on Computer Architecture
1985
Corpus ID: 15851689
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…
Expand
Highly Cited
1975
Highly Cited
1975
Computing joins of relations
L. Gotlieb
ACM SIGMOD Conference
1975
Corpus ID: 17114048
Little has appeared on the problems of efficiently storing, accessing, and manipulating relations. These are of considerable…
Expand
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)
ACCEPT & CONTINUE