Sciweavers

Share
ICDE
2005
IEEE

On the Optimal Ordering of Maps and Selections under Factorization

9 years 6 months ago
On the Optimal Ordering of Maps and Selections under Factorization
The query optimizer of a database system is confronted with two aspects when handling user-defined functions (UDFs) in query predicates: the vast differences in evaluation costs between UDFs (and other functions) and multiple calls of the same (expensive) UDF. The former is dealt with by ordering the evaluation of the predicates optimally, the latter by identifying common subexpressions and thereby avoiding costly recomputation. Current approaches order n predicates optimally (neglecting factorization) in O(n log n). Their result may deviate significantly from the optimal solution under factorization. We formalize the problem of finding optimal orderings under factorization and prove that it is NP-hard. Furthermore, we show how to improve on the run time of the bruteforce algorithm (which computes all possible orderings) by presenting different enhanced algorithms. Although in the worst case these algorithms obviously still behave exponentially, our experiments demonstrate that for re...
Thomas Neumann, Sven Helmer, Guido Moerkotte
Added 01 Nov 2009
Updated 01 Nov 2009
Type Conference
Year 2005
Where ICDE
Authors Thomas Neumann, Sven Helmer, Guido Moerkotte
Comments (0)
books