106 search results - page 1 / 22 » Query Optimization by Predicate Move-Around |
VLDB
1994
ACM
13 years 8 months ago
1994
ACM
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
SIGMOD
1993
ACM
13 years 8 months ago
1993
ACM
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 ...
VLDB
1998
ACM
13 years 8 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
SIGMOD
2003
ACM
14 years 4 months ago
2003
ACM
Decision-support applications generate queries with complex predicates. We show how the factorization of complex query expressions exposes significant opportunities for exploiting...
PPDP
2010
Springer
13 years 2 months ago
2010
Springer
Database query optimizers rely on data statistics in selecting query execution plans. Similar query optimization techniques are desirable for deductive databases and, to make this...