[ACM Press the 35th SIGMOD international
โ
Neumann, Thomas
๐
Article
๐
2009
๐
ACM Press
โ 492 KB
Join ordering is one of the most important, but also most challenging problems of query optimization. In general finding the optimal join order is NP-hard. Existing dynamic programming algorithms exhibit exponential runtime even for the restricted, but highly relevant class of star joins. Therefore,