Debunking the Myth of Join Ordering: Toward Robust SQL Analytics · HackerPapers discussions

Debunking the Myth of Join Ordering: Toward Robust SQL Analytics — HN submission

Thu, 22 Jan 2026 05:14:47 GMT

Debunking the Myth of Join Ordering: Toward Robust SQL Analytics

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

Debunking the Myth of Join Ordering: Toward Robust SQL Analytics — mentioned by kmicinski

Sun, 15 Jun 2025 19:28:58 GMT

For materialization-heavy workloads (program analysis, etc.), we often find that optimized binary join plans (e.g., profile-optimized, hand-optimized, etc.) beat worst-case optimal plans due to the ability to get better scalability (less locking) without the need to use a trie-based representation. Within the space of worst-case optimal plans, there are still lots of choices: but a bad worst-case optimal plan can often beat a bad (randomly-chosen) binary plan. And of course (the whole point of this exercise), there are some queries where every binary plan explodes and you do need WCOJ.…

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

Debunking the Myth of Join Ordering: Toward Robust SQL Analytics — HN submission

Thu, 13 Mar 2025 14:04:04 GMT

Debunking the Myth of Join Ordering: Toward Robust SQL Analytics

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

Debunking the Myth of Join Ordering: Toward Robust SQL Analytics — HN submission

Mon, 03 Mar 2025 18:30:45 GMT

Debunking the Myth of Join Ordering: Toward Robust SQL Analytics

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