Joins: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 24: | Line 24: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Joins - Time.png|1000px]] | [[File:Joins - Time.png|1000px]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:Joins - Space.png|1000px]] | [[File:Joins - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[File:Joins - Pareto Frontier.png|1000px]] | [[File:Joins - Pareto Frontier.png|1000px]] | ||
Revision as of 13:04, 15 February 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
n, m: 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
Space Complexity Graph
Pareto Frontier Improvements Graph
