Joins: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
(2 intermediate revisions by the same user not shown)
Line 6: Line 6:
== Parameters ==  
== Parameters ==  


n, m: sizes of input tables
$m,n$: sizes of input tables


== Table of Algorithms ==  
== Table of Algorithms ==  
Line 27: Line 27:


[[File:Joins - Time.png|1000px]]
[[File:Joins - Time.png|1000px]]
== Space Complexity Graph ==
[[File:Joins - Space.png|1000px]]
== Space-Time Tradeoff Improvements ==
[[File:Joins - Pareto Frontier.png|1000px]]

Latest revision as of 09:07, 28 April 2023

Description

An SQL join clause - corresponding to a join operation in relational algebra - combines columns from one or more tables in a relational database.

Parameters

$m,n$: sizes of input tables

Table of Algorithms

Name Year Time Space Approximation Factor Model Reference
Nested loop join 1960 $O(nm)$ $O({1})$ Exact Deterministic
Sort merge join 1960 $O(nlogn + mlogm)$ $O(n+m)$? Exact Deterministic
Hash join 1960 $O(n+m)$ $O(n+m)$? Exact Deterministic

Time Complexity Graph

Error creating thumbnail: Unable to save thumbnail to destination