(Enter summary)
Abstract: In this work, we propose and assess a technique called bypass
processing for optimizing the evaluation of disjunctive
queries with expensive predicates. The technique is particularly
useful for optimizing selection predicates that contain
terms whose evaluation costs vary tremendously; e.g.,
the evaluation of a nested subquery or the invocation of a
user-defined function in an object-oriented or extended relational
model may be orders of magnitude more expensive
than an attribute access (and... (Update)
Context of citations to this paper: More
...problem of optimization in the presence of expensive predicate and methods. Recently, expensive predicates drew more attention [CS93, HS93, H94, KMPS94]. These works were concerned with strategies for optimal or better placement of expensive predicates in evaluation plans,...
...22, 11] focuses on conjunctive selection conditions. Techniques to optimize arbitrary boolean selection conditions have been studied in [25, 24, 30]. Our work draws upon the known results in this area. See Section 3. 31 The problem of determining an optimal set of conditions...
Cited by: More
On the Optimal Ordering of Maps, Selections, and Joins.. - Neumann, Helmer..
(Correct)
Minimal Probing: Supporting Expensive Predicates for Top-k.. - Chang, Hwang (2002)
(Correct)
Mediated Query Processing Over Autonomous Data Sources - Yerneni (2001)
(Correct)
Similar documents (at the sentence level):
40.8%: Optimizing Disjunctive Queries in Object Bases - Kemper, Moerkotte, Peithner..
(Correct)
Active bibliography (related documents): More All
0.5: Optimization and Evaluation of Disjunctive Queries - Claussen, Kemper.. (1996)
(Correct)
0.3: Bypassing Joins in Disjunctive Queries - Steinbrunn, Peithner, Moerkotte.. (1995)
(Correct)
0.3: Predicate Migration: Optimizing Queries with Expensive.. - Hellerstein, Stonebraker (1993)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.6: Optimizing Queries with Universal Quantification.. - Claussen, Kemper, .. (1997)
(Correct)
0.3: Heuristic and Randomized Optimization for the Join.. - Steinbrunn, Moerkotte, .. (1997)
(Correct)
0.3: Optimizing Join Orders - Steinbrunn, Moerkotte, Kemper (1993)
(Correct)
Related documents from co-citation: More All
21: Predicate migration: Optimizing queries with expensive predicates
- Hellerstein, Stonebraker - 1993
12: Access path selection in a relational database management system (context) - Selinger, Astrahan et al. - 1979
10: Practical predicate placement
- Hellerstein - 1994
BibTeX entry: (Update)
A. Kemper, G. Moerkotte, K. Peithner, and M. Steinbrunn. Optimizing disjunctive queries with expensive predicates. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 336--347, Minneapolis, USA, May 1994. http://citeseer.ist.psu.edu/kemper94optimizing.html More
@inproceedings{ kemper94optimizing,
author = "A. Kemper and G. Moerkotte and K. Peithner and M. Steinbrunn",
title = "Optimizing disjunctive queries with expensive predicates",
pages = "336--347",
year = "1994",
url = "citeseer.ist.psu.edu/kemper94optimizing.html" }
Citations (may not include all citations):
389
Access path selection in a relational database management sy.. (context) - Selinger, Astrahan et al. - 1979 ACM DBLP
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 DBLP
85
Queries and query processing in object-oriented database sys..
- Ozsu, Straube ACM DBLP
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 ACM DBLP
62
Advanced query processing in object bases using access suppo..
- Kemper, Moerkotte - 1990
46
Rule-based optimization and query processing in an extensibl.. (context) - Becker, Guting - 1992 ACM DBLP
44
A rule-based view of query optimization (context) - Freytag - 1987
31
Control of an extensible query optimizer: A planningbased ap..
- Mitchell, Dayal et al. - 1993
30
Object-Oriented Database Management: Applications in Enginee.. (context) - Kemper, Moerkotte - 1994 DBLP
29
Extending the search strategy in a query optimizer (context) - Lanzelotte, Valduriez - 1991 ACM DBLP
25
A blackboard architecture for query optimization in object b..
- Kemper, Moerkotte et al. - 1993 ACM DBLP
22
Query optimization in object bases: Exploiting the relationa.. (context) - Kemper, Moerkotte
16
Optimizing Boolean expressions in object bases
- Kemper, Moerkotte et al. - 1992
15
Global query optimization (context) - Sellis - 1986 ACM DBLP
12
Optimizing join orders
- Steinbrunn, Moerkotte et al. - 1993
11
Extensible cost models and query optimization in GENESIS (context) - Batory - 1986
6
Sequencing with seriesparallel precedence constraints (context) - Monma, Sidney - 1979
5
An optimal evaluation of boolean expressions in an online qu.. (context) - Hanani - 1977 ACM DBLP
2
Query Processing for Advanced Applications (context) - Freytag, Maier et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.brown.edu/courses/cs227/readinglist.html): More
A Query Language and Optimization Techniques for.. - Buneman, Davidson.. (1996)
(Correct)
The Object-Oriented Database System Manifesto - Atkinson, Bancilhon, DeWitt.. (1989)
(Correct)
Rule Languages and Internal Algebras for Rule-Based Optimizers - Cherniack, Zdonik (1996)
(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