353 search results - page 4 / 71 » Processing Top-k Join Queries |
DMSN
2005
ACM
14 years 11 months ago
2005
ACM
In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. The objective of a top-k query...
PODS
2008
ACM
15 years 9 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
159
click to vote
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
ADC
2009
Springer
15 years 1 months ago
2009
Springer
Efficient XML filtering has been a fundamental technique in recent Web service and XML publish/subscribe applications. In this paper, we consider the problem of filtering a contin...
VLDB
2001
ACM
15 years 1 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...