Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,343,922 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
Query Optimization on Relational Databases for Supporting Top-k Query Processing Techniques
Abu Sayed Chowdhury
,
Rupam Deb
,
Moslema Jahan
2010
Corpus ID: 44467095
Abstract —Information systems apply various techniques to rank query answers. Ranking queries (or top-k queries) are dominant in…
Expand
2010
2010
Adaptive Join Operators for Result Rate Optimization on Streaming Inputs
Mihaela A. Bornea
,
V. Vassalos
,
Yannis Kotidis
,
Antonios Deligiannakis
IEEE Transactions on Knowledge and Data…
2010
Corpus ID: 16200580
Adaptive join algorithms have recently attracted a lot of attention in emerging applications where data are provided by…
Expand
2007
2007
How to scalably and accurately skip past streams
S. Bhatlacharyya
,
A. Madeira
,
S. Muthukrishnan
,
Tao Ye
IEEE 23rd International Conference on Data…
2007
Corpus ID: 7496601
Data stream methods look at each new item of the stream, perform a small number of operations while keeping a small amount of…
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
2000
2000
DISCRETE-EVENT SIMULATION OF QUEUING SYSTEMS
Zhang Laifu Joel
,
Wei-Fang Wen
,
J. Louis
,
S. Tay
2000
Corpus ID: 15761772
The type of queuing system a business uses is an important factor in determining how efficient the business is run. In this…
Expand
1998
1998
Evaluating Functional Joins Along Nested Reference Sets in Object-Relational and Object-Oriented Databases
R. Braumandl
,
Jens Claußen
,
A. Kemper
Very Large Data Bases Conference
1998
Corpus ID: 7831531
Previous work on functional joins was constrained in two ways: (1) all approaches we know assume references being implemented as…
Expand
1998
1998
The Heterogeneity Problem and Middleware Technology: Experiences with and Performance of Database Gateways
Fernando de Ferreira Rezende
,
Klaudia Hergula
Very Large Data Bases Conference
1998
Corpus ID: 211085
In this paper, we present the results that we have obtained by comparing and testing three well-known database middleware…
Expand
1994
1994
A criterion for some Hamiltonian graphs to be Hamilton-connected
A. Asratian
The Australasian Journal of Combinatorics
1994
Corpus ID: 20508629
Let M = {G / Kn,n ~ G ~ Kn V for some n 2:: 3} where V is the join operation. The author and N.K. Khachatrian proved that a…
Expand
1993
1993
A truncating hash algorithm for processing band-join queries
V. Soloviev
Proceedings of IEEE 9th International Conference…
1993
Corpus ID: 15095269
The truncating-hash band join algorithm for evaluating band joins is described. This algorithm is based on the idea of truncating…
Expand
1974
1974
The cohomology rings of certain finite permutation representations
James V. Blowers
1974
Corpus ID: 109936109
In this paper the concept of join of two permutation representations is defined and the cohomology of this join is computed and…
Expand