Box Covers and Domain Orderings for Beyond Worst-Case Join Processing · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1909.12102/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTBox Covers and Domain Orderings for Beyond Worst-Case Join Processing — mentioned by namibjhttps://news.ycombinator.com/item?id=45026494urn:hackerpapers:mention:1909.12102:45026494Tue, 26 Aug 2025 13:46:04 GMT<p>Or, instead of &quot;estimate the distribution&quot; look at what conceptual properties of the instance the big-O cares about. And then derive big-O in terms of such properties. See for example Tetris-LoadBalanced and Tetris-Reordered (on top of Tetris-LoadBalanced) for such works: https://arxiv.org/abs/1909.12102</p><p><a href="https://hackerpaper.kaipfister.de/p/1909.12102/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DB