Dependency-aware reordering for parallelizing query optimization in multi-core CPUs

@inproceedings{Han2009DependencyawareRF,
  title={Dependency-aware reordering for parallelizing query optimization in multi-core CPUs},
  author={Wook-Shin Han and Jinsoo Lee},
  booktitle={SIGMOD Conference},
  year={2009}
}
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evaluating redundant sub-plans. The number of alternative QEPs enumerated by the DP query optimizer can increase exponentially, as the number of joins in the query increases. Recently, by exploiting the coming wave of multi-core processor architectures, a state of the art parallel optimization algorithm [14], referred to as… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 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
  • In VLDB,
  • 2006
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…