Leapfrog Triejoin: a worst-case optimal join algorithm · HackerPapers discussions

Leapfrog Triejoin: a worst-case optimal join algorithm — HN submission

Sat, 01 Feb 2020 21:11:55 GMT

Leapfrog Triejoin: a worst-case optimal join algorithm

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Leapfrog Triejoin: a worst-case optimal join algorithm — mentioned by jamii

Sat, 24 Jan 2015 00:32:28 GMT

Some of the more exciting ideas I've seen recently: http://arxiv.org/abs/1310.3314 - Understanding the core difficulty in answering relational queries and examples of problems for which current query optimisers always produce plans which are asymptotically suboptimal http://arxiv.org/abs/1404.0703 - The first theoretical analysis which can relate the choice of indexes to worst-case bounds. Presents a single join algorithm which is asymptotically optimal on every problem without even using cardinality estimates. http://arxiv.org/abs/1210.0481 - A join algorithm that meets some of the bounds of…

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

Leapfrog Triejoin: a worst-case optimal join algorithm — mentioned by jamii

Tue, 07 Oct 2014 18:42:53 GMT

There is still plenty of room for improvement. See eg http://arxiv.org/abs/1210.0481

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