See this document in CiteSeerX!

On the Optimal Ordering of Maps, Selections, and Joins under Factorization  (Make Corrections)  
Thomas Neumann, Sven Helmer, Guido Moerkotte



  Home/Search   Context   Related

 
View or download:
db.informatik.uni...fact_bncod2006.pdf
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  db.informatik.u...Details.html.en (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We examine the problem of producing the optimal evaluation order for queries containing joins, selections, and maps. Specifically, we look at the case where common subexpressions involving expensive UDF calls can be factored out. First, we show that ignoring factorization during optimization can lead to plans that are far o# the best possible plan: the di#erence in cost between the best plan considering factorization and the best plan not considering factorization can easily reach several ... (Update)

Active bibliography (related documents):   More   All
0.4:   Query Execution Techniques for Caching Expensive Methods - Hellerstein, Naughton (1996)   (Correct)
0.3:   Efficient Dynamic Programming Algorithms for Ordering.. - Scheufele, Moerkotte (1997)   (Correct)
0.3:   Optimal Ordering of Selections and Joins in Acyclic.. - Scheufele, Moerkotte   (Correct)

System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ neumann-optimal,
  author = "Thomas Neumann and Sven Helmer and Guido Moerkotte",
  title = "On the Optimal Ordering of Maps, Selections, and Joins under Factorization",
  url = "citeseer.ist.psu.edu/763923.html" }
Citations (may not include all citations):
333   An Introduction to Functional Programming (context) - Bird, Wadler - 1988  ACM
88   Predicate migration: Optimizing queries with expensive predi.. - Hellerstein, Stonebraker - 1993  DBLP
88   Predicate migration: Optimizing queries with expensive predi.. - Hellerstein - 1992  DBLP
64   Measuring the complexity of join enumeration in query optimi.. (context) - Ono, Lohman - 1990  ACM   DBLP
32   Optimization of queries with user-defined predicates - Chaudhuri, Shim - 1996
32   Optimization of queries with user-defined predicates - Chaudhuri, Shim - 1999  ACM   DBLP
32   Practical predicate placement - Hellerstein - 1994
26   Optimizing disjunctive queries with expensive predicates - Kemper, Moerkotte et al. - 1994  ACM   DBLP
24   Query execution techniques for caching expensive methods - Hellerstein, Naughton - 1996  ACM   DBLP
24   the optimal nesting order for computing n-relational joins (context) - Ibaraki, Kameda - 1984
14   Bypassing joins in disjunctive queries - Steinbrunn, Peithner et al. - 1995  ACM   DBLP
5   Optimization of boolean expressions in object bases (context) - Kemper, Moerkotte et al. - 1992
3   Optimization of queries including adt functions (context) - Yajima, Kitagawa et al. - 1991  ACM   DBLP
1   Factorizing complex predicates in queries to exploit indexes (context) - Chaudhuri, Ganesan et al. - 2003  ACM   DBLP
1   the optimal ordering of maps and selections under factorizat.. (context) - Neumann, Helmer et al. - 2005
1   Optimal ordering of selections and joins in acyclic queries .. - Scheufele, Moerkotte - 1996
1   cient dynamic programming algorithms for ordering expensive .. (context) - Scheufele, Moerkotte - 1998
1   Improved prediction of signal peptides: SignalP (context) - Bendtsen, Nielsen et al. - 2004
1   Protein targeting (context) - Blobel - 2000

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC