Sophie Cluet, Guido Moerkotte  Home/Search
Context Related
| pi3.informatik.unimannheim...icdt95.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pi3.informatik....Details.html.en (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Producing optimal left-deep trees is known to be NP-complete for general join graphs and a quite complex cost function counting disk accesses for a special blockwise nested-loop join [2]. Independent of any cost function is the dynamic programming approach to join ordering. The number of alternatives this approach generates is known as well [5]. Further, it is known that for some cost functions --- those fulfilling the ASI property [4] --- the problem can be solved in polynomial time for... (Update)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
S. Cluet and G. Moerkotte. On the complexity of generating optimal leftdeep processing trees with cross products. In Proc. Int. Conf. on Database Theory (ICDT), pages 54--67, 1995. http://citeseer.ist.psu.edu/cluet94complexity.html More
@inproceedings{ cluet95complexity,
author = "Sophie Cluet and Guido Moerkotte",
title = "On the Complexity of Generating Optimal Left-Deep Processing Trees with Cross Products",
booktitle = "{ICDT}",
pages = "54-67",
year = "1995",
url = "citeseer.ist.psu.edu/cluet94complexity.html" }
Citations (may not include all citations):4212 Computers and Intractability: a Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
389 Access path selection in a relational database management sy.. (context) - Selinger, Astrahan et al. - 1979
78 Optimization of nonrecursive queries (context) - Krishnamurthy, Boral et al. - 1986
64 Measuring the complexity of join enumeration in query optimi.. (context) - Ono, Lohman - 1990
29 Optimal nesting for computing n-relational joins (context) - Ibaraki, Kameda - 1984
26 Sequencing with series-parallel precedence constraints (context) - Monma, Sidney - 1979
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