| 摘要 |
<p>Techniques are provided for using near-full bloom filters for efficiently identifying hash slices in which the deviation between replicas is sufficient to justify remedial measures. Techniques are also described for adjusting the size of slices and the size of the bloom filters, so that the bloom-filter-to-bloom-filter comparison serves as an accurate indicator of the degree to which the contents of the slices of a slice pair have deviated. Slice size may vary from slice pair to slice pair, so that relatively sparsely populated portions of the ring (access key ranges into which fewer chunks fall) are represented by relatively larger slices, while relatively densely populated portions of the ring (access key ranges into which more chunks fall) are represented by relatively smaller slices.</p> |
