356 search results - page 12 / 72 » Robust and efficient algorithms for rank join evaluation |
90
Voted
SIGMOD
2002
ACM
15 years 9 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...
ICML
2009
IEEE
15 years 10 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...
150
click to vote
SIGMOD
2007
ACM
15 years 9 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...
107
click to vote
WWW
2005
ACM
15 years 3 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...
DEXA
2005
Springer
15 years 3 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...