115 search results - page 1 / 23 » Predicate Migration: Optimizing Queries with Expensive Predi... |
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 ...
SBBD
2003
13 years 5 months ago
2003
A common requirement of many scientific applications is the ability to process queries involving expensive predicates corresponding to user programs. Optimizing such queries is ha...
SIGMOD
2002
ACM
14 years 4 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
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
2005
ACM
14 years 4 months ago
2005
ACM
Many analysis and monitoring applications require the repeated execution of expensive modeling functions over streams of rapidly changing data. These applications can often be exp...