Worst-case optimal join algorithm
id:
worst-case-optimal-join-algorithm-316-2561978
title:
Worst-case optimal join algorithm
text:
A worst-case optimal join algorithm is an algorithm for computing relational joins with a runtime that is bounded by the worst-case output size of the join. Traditional binary join algorithms such as hash join operate over two relations at a time; joins between more than two relations are implemented by repeatedly applying binary joins. Worst-case optimal join algorithms are asymptotically faster in worst case than any join algorithm based on such iterated binary joins. The first worst-case opti
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithm for computing relational joins
original url:
https://en.wikipedia.org/wiki/Worst-case_optimal_join_algorithm
date created:
date modified:
2023-12-25T05:53:01Z
main entity:
{"identifier":"Q117209915","url":"https://www.wikidata.org/entity/Q117209915"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/d8/Comparison_of_join_algorithms.png","width":1955,"height":1155}
fields total:
13
integrity:
15