Dynamic programming strikes back

  title={Dynamic programming strikes back},
  author={Guido Moerkotte and Thomas Neumann},
  booktitle={SIGMOD Conference},
Two highly efficient algorithms are known for optimally ordering joins while avoiding cross products: DPccp, which is based on dynamic programming, and Top-Down Partition Search, based on memoization. Both have two severe limitations: They handle only (1) simple (binary) join predicates and (2) inner joins. However, real queries may contain complex join predicates, involving more than two relations, and outer joins as well as other non-inner joins. Taking the most efficient known join-ordering… CONTINUE READING
Highly Cited
This paper has 68 citations. REVIEW CITATIONS
45 Citations
7 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 45 extracted citations

68 Citations

Citations per Year
Semantic Scholar estimates that this publication has 68 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-7 of 7 references

Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy trees without cross products

  • G. Moerkotte, T. Neumann
  • In VLDB,
  • 2006
Highly Influential
8 Excerpts

Query optimization in the IBM DB2 family

  • P. Gassner, G. Lohman, K. Schiefer
  • IEEE Data Engineering Bulletin,
  • 1993
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…