360 search results - page 34 / 72 » Distributed Network Querying with Bounded Approximate Cachin... |
123
Voted
CJ
2010
15 years 3 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
131
Voted
PVLDB
2008
15 years 3 months ago
2008
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
124
click to vote
SIGIR
2004
ACM
15 years 9 months ago
2004
ACM
: We consider the problem of collaborative Web search and query routing strategies in a peer-to-peer (P2P) environment. In our architecture every peer has a full-fledged search en...
127
Voted
HPDC
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper defines and describes a fully distributed implementation of Google’s highly effective Pagerank algorithm, for “peer to peer”(P2P) systems. The implementation is ...
230
click to vote
ICDE
2003
IEEE
16 years 5 months ago
2003
IEEE
The problem of statistics and aggregate maintenance over data streams has gained popularity in recent years especially in telecommunications network monitoring, trend-related anal...