In this paper, we address the problem of joining ranked results produced by two or more
services on the web. We consider services endowed with two kinds of access that are often …

We show aggregation constraints that naturally arise in several applications can enrich the
semantics of rank join queries, by allowing users to impose their application-specific …

Rank join operators perform a relational join among two or more relations, assign numeric
scores to the join results based on the given scoring function and return K join results with …

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 practice that the inputs …

We introduce the proximity rank join problem, where we are given a set of relations whose
tuples are equipped with a score and a real-valued feature vector. Given a target feature …

In the rank join problem we are given a relational join R 1 x R 2 and a function that assigns
numeric scores to the join tuples, and the goal is to return the tuples with the highest score …

Rank join operators perform a relational join among two or more relations, assign numeric
scores to the join results based on a given scoring function, and return K join results with the …

We introduce the proximity rank join problem, where we are given a set of relations whose
tuples are equipped with a score and a real-valued feature vector. Given a target feature …

A top-k query combines different rankings of the same set of objects and returns the k
objects with the highest combined score according to an aggregate function. We bring to …

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. This …