×

Indicating multiple encoding schemes in a dispersed storage network

  • US 10,334,045 B2
  • Filed: 06/06/2016
  • Issued: 06/25/2019
  • Est. Priority Date: 06/06/2016
  • Status: Active Grant
First Claim
Patent Images

1. A method for execution by a dispersed storage and task (DST) processing unit that includes a processor, the method comprises:

  • transmitting via a network a first write request that includes at least one first encoded data slice of a first data object, and an original first slice identifier corresponding to the at least one first encoded data slice, wherein the at least one first encoded data slice is encoded under a first encoding scheme, and wherein the at least one first encoded data slice is assigned to at least one first memory location of a distributed storage network (DSN) based on the original first slice identifier;

    transmitting via the network a second write request that includes at least one second encoded data slice of the first data object, and a second slice identifier corresponding to the at least one second encoded data slice, wherein the at least one second encoded data slice is encoded under a second encoding scheme, and wherein the at least one second encoded data slice is assigned to at least one second memory location of the DSN based on the second slice identifier;

    receiving via the network a first access request to access the first data object;

    generating a derived second slice identifier in response to determining that the first data object requested for access is stored under multiple encoding schemes;

    transmitting via the network a first read request that includes the derived second slice identifier to access the at least one second encoded data slice;

    generating a new first object identifier to indicate the first data object utilizing a reversible function on the original first object identifier, by;

    generating the first slice identifier based on the original first object identifier;

    generating a derived original first object identifier by utilizing an inverse function of the reversible function on the new first object identifier; and

    generating a derived first slice identifier based on the derived original first object identifier;

    wherein the derived second slice identifier is generated by performing a deterministic function on the first slice identifier; and

    wherein the reversible function includes multiplying the original first object identifier by a large prime number to generate the new first object identifier, and wherein determining that the first data object is stored under multiple encoding schemes includes determining that a quotient of a division of the new first object identifier by the large prime number is an integer, and wherein the derived original first object identifier is based on the quotient; and

    replacing an original first object identifier that identifies the first data object with the new first object identifier.

View all claims
  • 2 Assignments
Timeline View
Assignment View
    ×
    ×