356 search results - page 12 / 72 » Robust and efficient algorithms for rank join evaluation |
167
Voted
SIGMOD
2002
ACM
16 years 6 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...
161
click to vote
ICML
2009
IEEE
16 years 6 months ago
2009
IEEE
This paper gives an efficient Bayesian method for inferring the parameters of a PlackettLuce ranking model. Such models are parameterised distributions over rankings of a finite s...
257
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
194
click to vote
WWW
2005
ACM
15 years 11 months ago
2005
ACM
To improve search efficiency and reduce unnecessary traffic in Peerto-Peer (P2P) networks, this paper proposes a trust-based probabilistic search algorithm, called preferential wa...
183
click to vote
DEXA
2005
Springer
15 years 11 months ago
2005
Springer
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Holistic twig join algorithm has showed its superiorit...