# US 2019/0171519 A1 · Storing data and associated metadata in a dispersed storage network

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0171519 A1
- Document ID: US20190171519A1
- Status: Published application
- Kind: A1
- Application number: 16/273,552
- Filed: 2019-02-12
- Published: 2019-06-06
- Earliest claimed: 2015-07-31
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Scott M. Horan; Wesley B. Leggette
- Web page: https://patentgrep.com/patent/US20190171519A1

## CPC

- G06F 11/108: {Parity data distribution in semiconductor storages, e.g. in SSD}
- G06F 3/0604: {Improving or facilitating administration, e.g. storage management}
- G06F 3/0605: {by facilitating the interaction with a user or administrator}
- G06F 3/061: {Improving I/O performance}
- G06F 3/0619: {in relation to data integrity, e.g. data losses, bit errors}
- G06F 3/0622: {in relation to access}
- G06F 3/0643: {Management of files}
- G06F 3/0644: {Management of space entities, e.g. partitions, extents, pools}
- G06F 3/0647: {Migration mechanisms}
- G06F 3/065: {Replication mechanisms}
- G06F 3/0653: {Monitoring storage devices or systems}
- G06F 3/0668: {adopting a particular infrastructure}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 3/0689: {Disk arrays, e.g. RAID, JBOD}
- G06F 11/1076: {Parity data used in redundant arrays of independent storages, e.g. in RAID systems}
- G06F 11/1662: {the resynchronized component or unit being a persistent storage device (re-synchronization of failed mirror storage G06F11/2082; rebuild or reconstruction of parity RAID storage G06F11/1008)}
- G06F 11/3034: {where the computing system component is a storage system, e.g. DASD based or network based (digital input from or digital output to record carriers G06F3/06; digital recording or reproducing G11B20/18; for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS], H04L67/1097)}
- G06F 13/4282: {on a serial bus, e.g. I2C bus, SPI bus (on daisy chain buses G06F13/4247)}
- G06F 16/122: {using management policies (point-in-time backing up or restoration of persistent data G06F11/1446; file migration policies for HSM systems G06F16/185)}
- G06F 16/1824: {implemented using Network-attached Storage [NAS] architecture (distributed or networked storage systems G06F3/067; protocols for distributed storage of data in a network H04L67/1097)}
- G06F 16/24578: {using ranking}
- G06F 21/6218: {to a system of files or objects, e.g. local or distributed file system or database}
- G06F 21/645: {using a third party}
- H03M 13/2906: {using block codes (H03M13/2957 takes precedence)}
- H03M 13/3761: {using code combining, i.e. using combining of codeword portions which may have been transmitted separately, e.g. Digital Fountain codes, Raptor codes or Luby Transform [LT] codes}
- H04L 9/0861: {Generation of secret information including derivation or calculation of cryptographic keys or passwords}
- H04L 63/061: {for key exchange, e.g. in peer-to-peer networks (cryptographic mechanisms or cryptographic arrangements for key agreement H04L9/0838)}
- H04L 63/0853: {using an additional device, e.g. smartcard, SIM or a different communication terminal (cryptographic mechanisms or cryptographic arrangements for entity authentication involving additional secure or trusted devices H04L9/3234)}
- H04L 63/108: {when the policy decisions are valid for a limited amount of time}
- H04L 67/1097: for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
- H04L 67/63: Routing a service request depending on the request content or context
- G06F 3/064: {Management of blocks}
- G06F 2201/805: Real-time
- H03M 13/1515: {Reed-Solomon codes}
- H04L 63/0428: {wherein the data content is protected, e.g. by encrypting or encapsulating the payload}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A dispersed storage (DS) processing unit includes a processing module generating metadata for a data object. The DS processing unit further includes a partitioner to partition the data object to produce a plurality of data segments. The DS processing unit further includes a first dispersed storage error encoder encoding the metadata and at least a first data segment using first dispersal parameters to produce a set of encoded metadata slices with a set of first data segment encoded data slices. The DS processing unit further includes a second dispersed storage error encoding a plurality of additional data segments, not including the first data segment, using second dispersal parameters to produce a plurality of additional sets of encoded data slices. The DS processing unit further includes a grouping selector facilitating storage of the set of metadata slices, the first set of encoded data slices and the plurality of additional sets of encoded data slices in a storage set.

## Claims

### Claim 1

A dispersed storage processing unit comprises:
a processing module generating metadata for a data object;
a first dispersed storage error encoder disperse storage error encoding the metadata to produce a set of metadata slices, wherein the first disperse storage error encoder utilizes first dispersal parameters to store the metadata, the first dispersal parameters including a decode threshold of 1;
a data partitioner partitioning the data object to produce a plurality of data segments;
the first disperse storage error encoder encoding at least a first data segment of the plurality of data segments to produce a first set of encoded data slices, wherein the first disperse storage error encoder utilizes the first dispersal parameters of the metadata, the first dispersal parameters including a decode threshold of 1;
a second disperse storage error encoder encoding additional data segments of the plurality of data segments to produce a plurality of sets of encoded data slices, wherein the additional data segments do not include the at least a first data segment and wherein the second disperse storage error encoder utilizes second dispersal parameters, the second dispersal parameters different from the first dispersal parameters and including a decode threshold greater than 1; and
a grouping selector facilitating storage of the set of metadata slices, the first set of encoded data slices and the plurality of sets of encoded data slices in one or more storage units of a dispersed storage network (DSN); and
wherein subsequent accessing of the metadata slices reproduces the metadata and the first data segment of the data object, making the first data segment of the data object available for use by one or more computing devices while continuing to retrieve the additional data segments from the DSN.

### Claim 2 (depends on 1)

The dispersed storage processing unit of claim 1, wherein the first dispersed storage error encoder utilizes the first dispersal parameters to store a copy of the metadata in each storage unit.

### Claim 3 (depends on 1)

The dispersed storage processing unit of claim 1, wherein the partitioning is in accordance with a data segmentation approach.

### Claim 4 (depends on 3)

The dispersed storage processing unit of claim 3, wherein the data segmentation approach includes any of: fixed size, segment size ramping-up, or segment size ramping-down.

### Claim 5 (depends on 1)

The dispersed storage processing unit of claim 1 further comprises, for each storage unit of a selected storage set, issuing a write slice request to the storage unit, where the write slice request includes an associated metadata slice of the set of metadata slices and a plurality of associated encoded data slices of each set of encoded data slices.

### Claim 6 (depends on 5)

The dispersed storage processing unit of claim 5, wherein the plurality of associated encoded data slices of each set of encoded data slices includes a common pillar.

### Claim 7 (depends on 6)

The dispersed storage processing unit of claim 6, wherein the common pillar includes a set of storage units equal in number to a width of the common pillar.

### Claim 8

A dispersed storage processing unit of a dispersed storage network (DSN), the dispersed storage processing unit comprises:
an interface;
a local memory; and
a processing module operably coupled to the interface and the local memory to generate metadata for a data object;
a first dispersed storage error encoder to encode the metadata to produce a set of metadata slices, wherein the first disperse storage error encoder utilizes first dispersal parameters to store metadata, the first dispersal parameters including a decode threshold of 1;
a data partitioner to partition the data object to produce a plurality of data segments;
the first dispersed storage error encoder encoding at least a first data segment of the plurality of data segments to produce a first set of encoded data slices, wherein the first dispersed storage error encoder utilizes the first dispersal parameters of the metadata, the first dispersal parameters including a decode threshold of 1;
second dispersed storage error encoder encoding additional data segments of the plurality of data segments to produce a plurality of sets of encoded data slices, wherein the additional data segments do not include the at least a first data segment and wherein the second dispersed storage error encoder utilizes second dispersal parameters, the second dispersal parameters different from the first dispersal parameters and including a decode threshold greater than 1; and
a grouping selector facilitating storage of the set of metadata slices, the first set of encoded data slices and the plurality of sets of encoded data slices in one or more storage units of the DSN; and
wherein subsequent accessing of the set of metadata slices reproduces the metadata and the first data segment of the data object, making the first data segment of the data object available for use by one or more computing devices while continuing to retrieve the additional data segments from the DSN.

### Claim 9 (depends on 8)

The dispersed storage processing unit of claim 8, wherein the first dispersed storage error encoder utilizes the first dispersal parameters to store a copy of the metadata in each storage unit.

### Claim 10 (depends on 8)

The dispersed storage processing unit of claim 8, wherein the partitioning the data object is in accordance with a data segmentation approach.

### Claim 11 (depends on 10)

The dispersed storage processing unit of claim 10, wherein the data segmentation approach includes any of: fixed size, segment size ramping-up, or segment size ramping-down.

### Claim 12 (depends on 8)

The dispersed storage processing unit of claim 8 further comprises, for each storage unit of a selected storage set, issuing a write slice request to the storage unit, where the write slice request includes an associated metadata slice of the set of metadata slices and a plurality of associated encoded data slices of each set of encoded data slices.

### Claim 13 (depends on 12)

The dispersed storage processing unit of claim 12, wherein the plurality of associated encoded data slices of each set of encoded data slices includes a common pillar.

### Claim 14 (depends on 13)

The dispersed storage processing unit of claim 13, wherein the common pillar includes a set of storage units equal in number to a width of the common pillar.

### Claim 15

A storage unit in a dispersed storage network (DSN) comprises:
a grouping de-selector facilitating retrieval of a set of encoded metadata slices and a plurality of sets of encoded data slices from one or more storage units of the DSN;
a first dispersed storage error decoder decoding the set of encoded metadata slices to produce metadata, wherein the first dispersed storage error decoder utilizes first dispersal parameters including a decode threshold of 1;
the first dispersed storage error decoder further decoding at least a first set of encoded data slices to produce at least a first data segment of a plurality of data segments, wherein the first disperse storage error decoder utilizes the first dispersal parameters of the set of encoded metadata slices including a decode threshold of 1;
a second dispersed storage error decoder decoding additional ones of the plurality of sets of encoded data slices data segments to produce a plurality of additional data segments, wherein the additional data segments do not include the at least a first data segment and wherein the second disperse storage error decoder utilizes second dispersal parameters, the second dispersal parameters different from the first dispersal parameters and including a decode threshold greater than 1; and
a data de-partitioner combining the at least a first data segment with the plurality of additional data segments to produce a data object; and
wherein accessing of the set of encoded metadata slices reproduces the metadata and the first data segment of the data object, making the first data segment of the data object available for use by the one or more computing devices while continuing to retrieve the additional data segments from the DSN.

### Claim 16 (depends on 15)

The storage unit of claim 15, wherein the combining is in accordance with a data de-segmentation approach.

### Claim 17 (depends on 16)

The storage unit of claim 16, wherein the data de-segmentation approach includes any of: fixed size, segment size ramping-up, or segment size ramping-down.

### Claim 18 (depends on 17)

The storage unit of claim 17 further comprises, for each storage unit of a selected storage set, issuing a read slice request to the storage unit, where the read slice request includes an retrieving an associated metadata slice of the set of metadata slices and a plurality of associated encoded data slices of each set of encoded data slices.

### Claim 19 (depends on 18)

The storage unit of claim 18, wherein the plurality of associated encoded data slices of each set of encoded data slices includes a common pillar.

### Claim 20 (depends on 15)

The storage unit of claim 15, wherein the first dispersed storage error decoder utilizes the first dispersal parameters to retrieve a copy of the encoded metadata slices from each storage unit.
