Tag
A technical deep-dive blog series exploring join ordering in query optimization, focusing on the German school of dynamic programming approaches (DPsize, DPsub, DPccp, DPhyp) and related work on adaptive optimization and join search space enumeration.
This paper studies the maximum strong independent set problem in hypergraphs, developing reductions, bounds, and a greedy algorithm with applications to deduplication tasks.