Dynamic programming strikes back

The most efficient known join-ordering algorithm, DPccp, is used as a starting point, and a new algorithm is developed, DPhyp, which is capable to handle complex join predicates efficiently, which gives dynamic programming a distinct advantage over current memoization techniques.