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

@article{Meister2006ErrataF,
  title={Errata for "Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products"},
  author={Andreas Meister and Guido Moerkotte and Gunter Saake},
  journal={PVLDB},
  year={2006},
  volume={11},
  pages={1069-1070}
}
Two approaches to derive dynamic programming algorithms for constructing join trees are described in the literature. We show analytically and experimentally that these two variants exhibit vastly diverging runtime behaviors for different query graphs. More specifically, each variant is superior to the other for one kind of query graph (chain or clique), but fails for the other. Moreover, neither of them handles star queries well. This motivates us to derive an algorithm that is superior to the… CONTINUE READING

From This Paper

Topics from this paper.

References

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

Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees Without Cross Products

G. Moerkotte, T. Neumann
VLDB, pages 930–941. VLDB End. • 2006
View 6 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…