See this document in CiteSeerX!

Bypassing Joins in Disjunctive Queries (1995)  (Make Corrections)  (14 citations)
Michael Steinbrunn, Klaus Peithner, Guido Moerkotte, Alfons Kemper
The VLDB Journal



  Home/Search   Context   Related

 
View or download:
pi3.informatik.unim...vldb95.bypass.ps
db.fmi.unipassau....vldb95.bypass.ps.Z
brown.edu/courses/cs227/pap...bypass.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  pi3.informatik.uni...publications (more)
From:  db.fmi.unipassau.de/...reference
(Enter author homepages)

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

Abstract: The bypass technique, which was formerly restricted to selections only [KMPS94], is extended to join operations. Analogous to the selection case, the join operator may generate two output streams---the join result and its complement---whose subsequent operator sequence is optimized individually. By extending the bypass technique to joins, several problems have to be solved. (1) An algorithm for exhaustive generation of the search space for bypass plans has to be developed. (2) The search space... (Update)

Context of citations to this paper:   More

...we enhance OQL by an iif : then : else : j expression. It is useful for rewriting outer restrictions as proposed in [Mur88, SPMK95, CM95a]. At the algebraic level, this is reAEected by an algebra operator if p (E true ; E false ) where E true is the result if p...

...the reject (complementary output) of the rst. This technique is termed bypassing and has recently been pointed out in the literature [SPMK95] Moreover, the operator set has a spread operator that allows replication of its input to a number of outputs, allowing multiple sub...

Cited by:   More
On the Optimal Ordering of Maps, Selections, and Joins.. - Neumann, Helmer..   (Correct)
Optimizing Queries with Universal Quantification.. - Claussen, Kemper, .. (1997)   (Correct)
Query Execution Techniques for Caching Expensive Methods - Hellerstein, Naughton (1996)   (Correct)

Similar documents (at the sentence level):
70.3%:   Bypassing Joins in Disjunctive Queries - Steinbrunn, Peithner, Moerkotte.. (1995)   (Correct)
7.4%:   Optimization and Evaluation of Disjunctive Queries - Claussen, Kemper.. (1996)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Optimizing Disjunctive Queries with Expensive Predicates - Kemper, Moerkotte.. (1994)   (Correct)
0.3:   Optimizing Disjunctive Queries in Object Bases - Kemper, Moerkotte, Peithner..   (Correct)
0.2:   Efficient Integration of Query Algebra Modules into an Extensible .. - Dieker (2001)   (Correct)

Related documents from co-citation:   More   All
9:   Predicate migration: Optimizing queries with expensive predicates - Hellerstein, Stonebraker - 1993
9:   Optimizing disjunctive queries with expensive predicates - Kemper, Moerkotte et al. - 1994
8:   Practical predicate placement - Hellerstein - 1994

BibTeX entry:   (Update)

Michael Steinbrunn, Klaus Peithner, Guido Moerkotte, and Alfons Kemper. Bypassing joins in disjunctive queries. In 21st International Conference on Very Large Data Bases, Zurich, Switzerland, September 1995. http://citeseer.ist.psu.edu/steinbrunn95bypassing.html   More

@inproceedings{ steinbrunn95bypassing,
    author = "Michael Steinbrunn and Klaus Peithner and Guido Moerkotte and Alfons Kemper",
    title = "Bypassing Joins in Disjunctive Queries",
    booktitle = "The {VLDB} Journal",
    pages = "228-238",
    year = "1995",
    url = "citeseer.ist.psu.edu/steinbrunn95bypassing.html" }
Citations (may not include all citations):
389   Access path selection in a relational database management sy.. (context) - Selinger, Astrahan et al. - 1979
127   Query optimization in database systems (context) - Jarke, Koch - 1984
106   The EXODUS optimizer generator - Graefe, DeWitt - 1987
104   The Volcano optimizer generator: Extensibility and efficient.. - Graefe, McKenna - 1993
93   Extensible query processing in starburst (context) - Haas, Freytag et al. - 1989
88   Predicate migration: Optimizing queries with expensive predi.. - Hellerstein, Stonebraker - 1993
85   Queries and query processing in object-oriented database sys.. - Ozsu, Straube - 1990
78   Optimization of nonrecursive queries (context) - Krishnamurthy, Boral et al. - 1986
78   A general framework for the optimization of object-oriented .. - Cluet, Delobel - 1992
73   Experiences building the Open OODB Query Optimizer (context) - Blakeley, McKenna et al. - 1993
67   Grammar-like functional rules for representing query optimiz.. (context) - Lohman - 1988
62   Advanced query processing in object bases using access suppo.. - Kemper, Moerkotte - 1990
54   Query optimization by predicate move-around - Levy, Mumick et al. - 1994
50   Query processing in a system for distributed databases (context) - Bernstein, Goodman et al. - 1981
46   Rule-based optimization and query processing in an extensibl.. (context) - Becker, Guting - 1992
44   A rule-based view of query optimization (context) - Freytag - 1987
32   Practical predicate placement - Hellerstein - 1994
31   Control of an extensible query optimizer: A planning-based a.. - Mitchell, Dayal et al. - 1993
30   Object-Oriented Database Management: Applications in Enginee.. (context) - Kemper, Moerkotte - 1994
26   Sequencing with series-parallel precedence constraints (context) - Monma, Sidney - 1979
26   Optimizing disjunctive queries with expensive predicates - Kemper, Moerkotte et al. - 1994
25   A blackboard architecture for query optimization in object b.. - Kemper, Moerkotte et al. - 1993
22   Object Database Standard (context) - Cattell - 1994
14   Query Processing for Advanced Database Systems (context) - Freytag, Maier et al. - 1993
14   Bypassing joins in disjunctive queries - Steinbrunn, Peithner et al. - 1994
11   Extensible cost models and query optimization in GENESIS (context) - Batory - 1986
6   Optimization of multipledisjunct queries in a relational dat.. (context) - Muralikrishna - 1988
6   Query optimization in a star computer network (context) - Kerschberg, Ting et al. - 1982
6   Towards an efficient evaluation of general queries: Quantifi.. (context) - Bry - 1989



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


Documents on the same site (http://pi3.informatik.uni-mannheim.de/publications.html):   More
Constructing Optimal Bushy Processing Trees for Join.. - Scheufele, Moerkotte (1996)   (Correct)
Evaluating Queries with Generalized Path Expressions - Vassilis Christophides (1996)   (Correct)
Bypassing Joins in Disjunctive Queries - Steinbrunn, Peithner, Moerkotte.. (1995)   (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