3 search results - page 1 / 1 » Minimal probing: supporting expensive predicates for top-k q... |
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...
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 ...
EDBT
2009
ACM
13 years 11 months ago
2009
ACM
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...