107 search results - page 4 / 22 » Proximity Rank Join |
CIKM
2010
Springer
13 years 5 months ago
2010
Springer
Complex search tasks that utilize information from several data sources, are answered by integrating the results of distinct basic search queries. In such integration, each basic ...
WWW
2006
ACM
14 years 8 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...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
COMCOM
2008
13 years 7 months ago
2008
Abstract-- We introduce in this paper CHESS, an applicationaware space for enhanced scalable services in overlay networks. In this new space, the proximity of peers is determined a...
VLDB
2004
ACM
14 years 7 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....