Query simplification
Published • Jun 29, 2009
NobleIDNI9P40W47R60S51
Authors:
Thomas Neumann
Abstract
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,...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!