Faster Plan Generation through Consideration of Functional Dependencies and Keys

@article{Eich2016FasterPG,
  title={Faster Plan Generation through Consideration of Functional Dependencies and Keys},
  author={Marius Eich and Pit Fender and Guido Moerkotte},
  journal={PVLDB},
  year={2016},
  volume={9},
  pages={756-767}
}
It has been a recognized fact for many years that query execution can benefit from pushing group-by operators down in the operator tree and applying them before a join. This so-called eager aggregation reduces the size(s) of the join argument(s), making join evaluation faster. Lately, the idea enjoyed a revival when it was applied to outer joins for the first time and incorporated in a state-of-the-art plan generator. However, this recent approach is highly dependent on the use of heuristics… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

Dynamic programming: The next step

  • 2015 IEEE 31st International Conference on Data Engineering
  • 2015
VIEW 16 EXCERPTS

Performing Group-By before Join

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Faster plan generation through consideration of functional dependencies and keys

M. Eich, P. Fender, G. Moerkotte
  • 2016
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Optimizing SQL Queries for Parallel Execution

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

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 Proc. Int. Conf. on Very Large Data Bases (VLDB),
  • 2006
VIEW 1 EXCERPT