Sciweavers

107 search results - page 3 / 22
» Proximity Rank Join
Sort
View
EUC
2006
Springer
13 years 10 months ago
Distributed Proximity-Aware Peer Clustering in BitTorrent-Like Peer-to-Peer Networks
In this paper, we propose a hierarchical architecture for grouping peers into clusters in a large-scale BitTorrent-like underlying overlay network in such a way that clusters are e...
Bin Xiao, Jiadi Yu, Zili Shao, Minglu Li
ICDE
2003
IEEE
114views Database» more  ICDE 2003»
14 years 7 months ago
Ranked Join Indices
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...
Panayiotis Tsaparas, Themistoklis Palpanas, Yannis...
VLDB
2001
ACM
82views Database» more  VLDB 2001»
13 years 10 months ago
Supporting Incremental Join Queries on Ranked Inputs
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. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 6 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 practic...
Karl Schnaitter, Neoklis Polyzotis
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 6 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis