CITI has stopped operations in 2014, to co-launch NOVA LINCS THIS SITE IS NOT BEING UPDATED SINCE 2013
citi banner
Home Page FCT/UNL UNL
  Home  \  Seminars @ CITI  \  Seminar Page Login  
   
banner bottom
File Top
Dynamic Programming for Join Ordering Revisited
{ Wed, 10 Dec 2008, 14h40 }

By: Guido Moerkotte  [ show info ]

The problem we are looking at is the generation of optimal bushy join operator trees which do not contain a cross product. In the literature as well as in commercial systems, several alternatives exist to solve this problem. Some of them use dynamic programming. We carefully analyze their complexity. Comparing the result with lower bounds will show that there exists room for improvement. This motivates a new algorithm, whose complexity will meet the lower bounds.


Hosted by: Software Systems

File Bottom