21 search results - page 5 / 5 » A Formal Reduction for Lock-Free Parallel Algorithms |
132
click to vote
SIGMOD
2002
ACM
16 years 3 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...