×

Estimating relative data importance in a dispersed storage network

  • US 10,394,630 B2
  • Filed: 10/26/2016
  • Issued: 08/27/2019
  • Est. Priority Date: 10/26/2016
  • Status: Active Grant
First Claim
Patent Images

1. A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN) having a plurality of storage units, the plurality of storage units storing a plurality of data objects in the form of encoded data slices, the method comprises:

  • generating a first importance ranking for a first data object of the plurality of data objects;

    generating a second importance ranking for a second data object of the plurality of data objects, the first importance ranking and the second importance ranking based on one or more ranking factor;

    detecting a plurality of the encoded data slices that require rebuilding, wherein each encoded data slice of the plurality of the encoded data slices is a dispersed storage error encoded portion of a respective one of the plurality of data objects, and wherein the plurality of the encoded data slices that require rebuilding include at least one encoded data slice of the first data object and at least one encoded data slice of the second data object;

    performing a comparison of the first importance ranking and the second importance ranking; and

    based on the comparison, assigning respective rebuilding priority levels to the at least one encoded data slice of the first data object and the at least one encoded data slice of the second data object.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×