English: An illustration of properties of algorithms for computing a relational join. When performing a join between more than two relations on more than two attributes, binary join algorithms such as hash join operate over two relations at a time, and join them on all attributes in the join condition; worst-case optimal algorithms such as generic join operate on a single attribute at a time but join all the relations on this attribute. The diagram is from the paper "Free Join: Unifying Worst-Case Optimal and Traditional Joins" by Yisu Remy Wang, Max Willsey, and Dan Suciu
This diagram image could be re-created using vector graphics as an SVG file. This has several advantages; see Commons:Media for cleanup for more information. If an SVG form of this image is available, please upload it and afterwards replace this template with {{vector version available|new image name}}.
It is recommended to name the SVG file “Comparison of join algorithms.svg”—then the template Vector version available (or Vva) does not need the new image name parameter.
to share – to copy, distribute and transmit the work
to remix – to adapt the work
Under the following conditions:
attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
https://creativecommons.org/licenses/by/4.0CC BY 4.0 Creative Commons Attribution 4.0 truetrue
Captions
An illustration of properties of algorithms for computing a relational join
Items portrayed in this file
depicts
copyright status
copyrighted
copyright license
Creative Commons Attribution 4.0 International
inception
25 January 2023
media type
image/png
checksum
5bf074ebe58567867b632b22c49ca7b3895512d1
determination method: SHA-1
data size
124,912 byte
height
1,155 pixel
width
1,955 pixel
File history
Click on a date/time to view the file as it appeared at that time.