Sciweavers

Share
PODS
2008
ACM

Evaluating rank joins with optimal cost

11 years 4 months ago
Evaluating rank joins with optimal cost
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 may be accessed in ranked order and the scoring function is monotonic. These conditions allow for efficient algorithms that solve the rank join problem without reading all of the input. In this paper, we present a thorough analysis of such rank join algorithms. A strong point of our analysis is that it is based on a more general problem statement than previous work, making it more relevant to the execution model that is employed by database systems. One of our results indicates that the well known HRJN algorithm has shortcomings, because it does not stop reading its input as soon as possible. We find that it is NP-hard to overcome this weakness in the general case, but cases of limited query complexity are tractable. We prove the latter with an algorithm that infers provably tight bounds on ...
Karl Schnaitter, Neoklis Polyzotis
Added 08 Dec 2009
Updated 08 Dec 2009
Type Conference
Year 2008
Where PODS
Authors Karl Schnaitter, Neoklis Polyzotis
Comments (0)
books