936 search results - page 65 / 188 » Data Replication in Mariposa |
202
click to vote
ICDCS
2011
IEEE
14 years 5 months ago
2011
IEEE
Many distributed software systems allow participation by large numbers of untrusted, potentially faulty components on an open network. As faults are inevitable in this setting, th...
182
click to vote
IDEAS
2006
IEEE
16 years 10 days ago
2006
IEEE
This paper proposes CADRE (Collaborative Allocation and Deallocation of Replicas with Efficiency), a dynamic replication scheme for improving the typically low data availability ...
150
click to vote
DATAMINE
1999
15 years 6 months ago
1999
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
143
click to vote
IJAHUC
2010
15 years 4 months ago
2010
: We consider the problem of routing locality in peer-to-peer storage systems where peers store and exchange data among themselves. With the global information, peers will take the...
140
click to vote
COLCOM
2005
IEEE
15 years 12 months ago
2005
IEEE
P2P data stores achieve high data availability by introducing replication of data. As a consequence, searching data may require to follow several routing paths introducing additio...