Worst-case Optimal Join Algorithms — mentioned by j-pb

Sun, 03 Jan 2021 10:24:49 GMT

It's all about efficient range reads and seek operations. You can compute set operations pretty efficiently using sorted indices that support a "find next or greater" operation. For intersection, take the first value from the first set as the smallest candidate of the output set, then call call candidate := next(candidate) on each set, updating the candidate with the next smallest possible value, and adding it to the output set when a candidate was returned by all sets. The algorithm is worst case optimal up to a log factor, and can even be extended to perform generic constraint programming…

Paper and discussion history. A mention is not an endorsement.

Worst-case Optimal Join Algorithms — mentioned by batbomb

Tue, 14 Apr 2015 00:17:32 GMT

Related (Referenced in the article): http://arxiv.org/abs/1203.1952 Chris Ré covers this in his CS345 course at Stanford.

Paper and discussion history. A mention is not an endorsement.

Worst-case Optimal Join Algorithms · HackerPapers discussions

Worst-case Optimal Join Algorithms — mentioned by j-pb

Worst-case Optimal Join Algorithms — mentioned by batbomb