356 search results - page 3 / 72 » Robust and efficient algorithms for rank join evaluation |
WWW
2006
ACM
14 years 6 months ago
2006
ACM
An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. T...
IR
2010
13 years 2 months ago
2010
RankSVM (Herbrich et al, 2000; Joachims, 2002) is a pairwise method for designing ranking models. SVMLight is the only publicly available software for RankSVM. It is slow and, due ...
ICDE
2003
IEEE
14 years 6 months ago
2003
IEEE
We investigate algorithms for evaluating moving window joins over pairs of unbounded streams. We introduce a unit-time-basis cost model to analyze the expected performance of thes...
ICDE
2003
IEEE
14 years 6 months ago
2003
IEEE
A plethora of data sources contain data entities that could be ordered according to a variety of attributes associated with the entities. Such orderings result effectively in a ra...
ICDE
2002
IEEE
14 years 6 months ago
2002
IEEE
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...