(Enter summary)
Abstract: The traditional focus of relational query optimization schemes has been on the choice of join methods and join
orders. Restrictions have typically been handled in query optimizers by "predicate pushdown" rules, which apply
restrictions in some random order before as many joins as possible. These rules work under the assumption that
restriction is essentially a zero-time operation. However, today's extensible and object-oriented database systems
allow users to define time-consuming functions,... (Update)
Cited by: More
On the Optimal Ordering of Maps, Selections, and Joins.. - Neumann, Helmer..
(Correct)
Efficient Dynamic Programming Algorithms for Ordering.. - Scheufele, Moerkotte (1997)
(Correct)
Constructing Optimal Bushy Trees Possibly Containing Cross.. - Moerkotte (2003)
(Correct)
Similar documents (at the sentence level):
73.1%: Predicate Migration: Optimizing Queries with Expensive.. - Hellerstein, Stonebraker (1993)
(Correct)
13.1%: Optimization Techniques For Queries with Expensive Methods - Hellerstein (1998)
(Correct)
Active bibliography (related documents): More All
0.6: Parallel Query Processing Using Shared Memory Multiprocessors and.. - Hong (1992)
(Correct)
0.4: Extensible/Rule Based Query Rewrite Optimization in.. - Pirahesh, Hellerstein.. (1992)
(Correct)
0.3: Magic is Relevant - Mumick, Finkelstein, Pirahesh.. (1990)
(Correct)
Similar documents based on text: More All
0.3: Using Coverage Maps to Represent the Environment of Mobile Robots - Wolfram
(Correct)
0.3: Exploring Unknown Environments with Mobile Robots using.. - Cyrill Stachniss Wolfram (2003)
(Correct)
0.3: On Approximation-based Query Evaluation, Expensive.. - Alexander Brodsky And (1995)
(Correct)
Related documents from co-citation: More All
30: Access path selection in a relational database management system (context) - Selinger, Astrahan et al. - 1979
24: Practical predicate placement
- Hellerstein - 1994
21: Optimizing disjunctive queries with expensive predicates
- Kemper, Moerkotte et al. - 1994
BibTeX entry: (Update)
Hellerstein, J. M. and M. Stonebraker (1993). Predicate migration: Optimizing queries with expensive predicates. In Proc. ACM SIGMOD Conference on Management of Data, pp. 267--276. http://citeseer.ist.psu.edu/article/hellerstein92predicate.html More
@inproceedings{ hellerstein93predicate,
author = "Joseph M. Hellerstein and Michael Stonebraker",
title = "Predicate migration: optimizing queries with expensive predicates",
pages = "267--276",
year = "1993",
url = "citeseer.ist.psu.edu/article/hellerstein92predicate.html" }
Citations (may not include all citations):
981
Principles of Database and Knowledge-Base Systems (context) - Ullman - 1989 ACM
389
Access Path Selection in a Relational Database Management Sy.. (context) - Selinger, Astrahan et al. - 1979 ACM DBLP
152
The Design of POSTGRES
- Stonebraker, Rowe - 1986 ACM DBLP
129
Starburst Mid-Flight: As the Dust Clears (context) - Haas, Chang et al. - 1990 DBLP
104
IEEE Transactions on Knowledge and Data Engineering (context) - Deux, of - 1990
78
Optimization of Nonrecursive Queries (context) - Krishnamurthy, Boral et al. - 1986 ACM DBLP
71
The POSTGRES Data Model
- Rowe, Stonebraker ACM DBLP
59
Of Nests and Trees: A Unified Approach to Processing Queries.. (context) - Dayal
54
Indexing in an Object-Oriented DBMS (context) - Maier, Stein - 1986 ACM DBLP
53
Development and Implementation of an Object-Oriented DBMS (context) - Maier, Stein - 1987 ACM DBLP
39
Rule-Based Query Rewrite Optimization in Starburst (context) - Pirahesh, Hellerstein et al. - 1992
32
Extended User-Defined Indexing with Application to Textual D.. (context) - Lynch, Stonebraker ACM DBLP
29
Optimal Nesting for Computing N-relational Joins (context) - Ibaraki, Kameda - 1984
29
Towards an Open Architecture for LDL
- Chimenti, Gamboa et al. - 1989 ACM
26
Sequencing with Series-Parallel Precedence Constraints (context) - Monma, Sidney - 1979
23
Managing Persistent Objects in a Multi-Level Store (context) - Stonebraker - 1991 ACM DBLP
18
Magic is Relevant (context) - Mumick, Finkelstein et al. - 1990 ACM DBLP
17
Efficient Sampling Strategies for Relational Database Operat.. (context) - Lipton, Naughton et al. - 1993 ACM DBLP
15
A Polynomial Time Algorithm for Optimizing Join Queries (context) - Swami, Iyer - 1992 ACM DBLP
14
A Performance Study of Query Optimization Algorithms on a Da.. (context) - Jhingran ACM DBLP
8
ASAP Comparative Relational Database Benchmark (context) - Orji, AS et al. - 1989
8
Optimization of Nested Queries in a Distributed Relational D.. (context) - Lohman, Daniels et al. ACM DBLP
7
Statistical Estimators for Relational Algebra Expressions (context) - Hou, Ozsoyoglu et al. - 1988 ACM DBLP
6
Electronics Research Laboratory (context) - Mosher, The et al. - 1990
6
Extending the POSTGRES Database System to Manage Tertiary St.. (context) - Olson - 1992
5
Revisiting DBMS Benchmarks (context) - O'Neil - 1989
3
ONTOS Object SQL Guide (context) - Inc - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://wuarchive.wustl.edu/packages/postgres/papers/): More
System Support for Software Fault Tolerance in Highly Available.. - Sullivan (1992)
(Correct)
Sub-element Indexing and Probabilistic Retrieval in the POSTGRES .. - Fontaine (1995)
(Correct)
VIQING: Visual Interactive QueryING - Olston, Stonebraker, Aiken.. (1998)
(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