580 search results - page 39 / 116 » Choosing a random peer |
ICDCS
2009
IEEE
15 years 9 months ago
2009
IEEE
In distributed storage systems, erasure codes represent an attractive solution to add redundancy to stored data while limiting the storage overhead. They are able to provide the s...
TPDS
2008
14 years 11 months ago
2008
Consistency maintenance is important to the sharing of dynamic contents in peer-to-peer (P2P) networks. The TTL-based mechanism is a natural choice for maintaining freshness in P2P...
ICDT
1999
ACM
15 years 4 months ago
1999
ACM
A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative e ectiveness. In order to empir...
140
click to vote
STACS
2012
Springer
13 years 7 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
CIKM
2007
Springer
15 years 6 months ago
2007
Springer
Index compression techniques are known to substantially decrease the storage requirements of a text retrieval system. As a side-effect, they may increase its retrieval performanc...