See this document in CiteSeerX!

Efficient Dynamic Programming Algorithms for Ordering Expensive Joins and Selections (1997)  (Make Corrections)  (6 citations)
Wolfgang Scheufele, Guido Moerkotte
Lecture Notes in Computer Science



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
pi3.informatik.uni...edbt98.dynprog.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

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

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

Abstract: The generally accepted optimization heuristics of pushing selections down does not yield optimal plans in the presence of expensive predicates. Therefore, several researchers have proposed algorithms to compute optimal processing trees for queries with expensive predicates. (Update)

Context of citations to this paper:   More

.... The size of the space that needs to be searched by a query optimizer employing dynamic programming is relatively well understood [11, 14, 20]. In this section we study the effect on the size of the search space in the presence of access pattern limitations, and the associated...

.... The size of the space that needs to be searched by a query optimizer employing dynamic programming is relatively well understood [8, 11, 19]. In this section we study the effect on the size of the search space in the presence of access pattern limitations, and the...

Cited by:   More
Efficient Dynamic Programming Algorithms for Ordering.. - Scheufele, Moerkotte (1997)   (Correct)
Efficient Evaluation of Queries with Mining Predicates - Chaudhuri, Narasayya.. (2002)   (Correct)
SECONDO: An Extensible DBMS Architecture and Prototype - Güting, Behr, Almeida..   (Correct)

Active bibliography (related documents):   More   All
0.3:   On the Optimal Ordering of Maps, Selections, and Joins.. - Neumann, Helmer..   (Correct)
0.3:   Dynamic Programming: a different perspective - Curtis (1997)   (Correct)
0.3:   A Relational Approach To Optimization Problems - Curtis (1996)   (Correct)

Similar documents based on text:
97.0:   Unknown -   (Correct)

Related documents from co-citation:   More   All
4:   Optimization of queries with user-defined predicates - Chaudhuri, Shim - 1996
4:   Predicate migration: Optimizing queries with expensive predicates - Hellerstein, Stonebraker - 1993
3:   Query optimization in the presence of foreign functions - Chaudhuri, Shim - 1993

BibTeX entry:   (Update)

W. Scheufele and G. Moerkotte. Efficient Dynamic Programming Algorithms for Ordering Expensive Joins and Selections. International Conference on Extending Data Base Technology, Valencia, Spain, March 1997. http://citeseer.ist.psu.edu/scheufele97efficient.html   More

@article{ scheufele98efficient,
    author = "Wolfgang Scheufele and Guido Moerkotte",
    title = "Efficient Dynamic Programming Algorithms for Ordering Expensive Joins and Selections",
    journal = "Lecture Notes in Computer Science",
    volume = "1377",
    pages = "201--??",
    year = "1998",
    url = "citeseer.ist.psu.edu/scheufele97efficient.html" }
Citations (may not include all citations):
981   Principles of Database and Knowledge-Base Systems (context) - Ullman - 1989  ACM
154   Introduction to Algorithms (context) - Leiserson, Cormen et al. - 1990  ACM
88   Predicate migration: Optimizing queries with expensive predi.. - Hellerstein, Stonebraker - 1993  DBLP
48   Query optimization in the presence of foreign functions - Chaudhuri, Shim - 1993  ACM   DBLP
34   Rapid bushy join-order optimization with cartesian products - Vance, Maier - 1996  ACM   DBLP
32   Optimization of queries with user-defined predicates - Chaudhuri, Shim - 1996  ACM   DBLP
32   Optimization of queries with user-defined predicates - Chaudhuri, Shim - 1997  ACM   DBLP
32   Practical predicate placement - Hellerstein - 1994  ACM   DBLP
29   Towards an open architecture for LDL - Gamboa, Chimenti et al. - 1989  ACM
10   Theory and Algorithms (context) - Minoux - 1986
6   Efficient dynamic programming algorithms for ordering expens.. - Scheufele, Moerkotte - 1998  ACM   DBLP
5   Optimization of boolean expressions in object bases (context) - Kemper, Moerkotte et al. - 1992
3   Monotonicity and the principle of optimality (context) - Morin - 1977



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://pi3.informatik.uni-mannheim.de/publikationenDetails.html.en):   More
Partition-Based Clustering in Object Bases: From.. - Gerlhof, Kemper.. (1993)   (Correct)
Main Memory Implementations for Binary Grouping - May, Moerkotte (2005)   (Correct)
Optimizing Queries with Universal Quantification.. - Claussen, Kemper, .. (1997)   (Correct)

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