# US 2024/0004570 A1 · Storage cluster data structure expansion

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

- Number: US 2024/0004570 A1
- Document ID: US20240004570A1
- Status: Published application
- Kind: A1
- Application number: 18/469,225
- Filed: 2023-09-18
- Published: 2024-01-04
- Earliest claimed: 2018-01-31
- Assignees: Pure Storage, Inc.
- Applicants: Pure Storage, Inc.
- Inventors: ROBERT LEE; JOHN MARTIN HAYES; FAISSAL SLEIMAN
- Web page: https://patentgrep.com/patent/US20240004570A1

## CPC

- G06F 3/0644: {Management of space entities, e.g. partitions, extents, pools}
- G06F 3/0604: {Improving or facilitating administration, e.g. storage management}
- G06F 3/0607: {by facilitating the process of upgrading existing storage systems, e.g. for improving compatibility between host and storage device}
- G06F 3/0631: {by allocating resources to storage systems}
- G06F 3/0632: {by initialisation or re-initialisation of storage systems}
- G06F 3/0635: {by changing the path, e.g. traffic rerouting, path reconfiguration}
- G06F 3/0637: {Permissions}
- G06F 3/0638: {Organizing or formatting or addressing of data}
- G06F 3/0652: {Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method for storage cluster expansion is provided. The method includes distributing user data throughout a storage cluster as directed by each of a plurality of authorities in the storage cluster. Each of the plurality of authorities has a plurality of wards, and each of the plurality of wards has ownership of a range of the user data. The method includes splitting one of the plurality of authorities, as a parent authority, into at least two child authorities and assigning a first subset of the plurality of wards of the parent authority to one of the at least two child authorities, and a second subset of the plurality of wards of the parent authority to another one of the at least two child authorities.

## Claims

### Claim 1

A method, comprising:
distributing data throughout storage nodes of a storage cluster in cooperation with a plurality of data structures in the storage cluster, wherein respective data structures have ownership of a range of the data;
generating at least two child data structures from one of the plurality of data structures; and
assigning a first subset of the data associated with the one of the plurality of data structures to a first child data structure, and a second subset of the data associated with the one of the plurality of data structures to a second child data structure.

### Claim 2 (depends on 1)

The method of claim 1, wherein one of the at least two child data structures remains in a same storage node as the parent data structure.

### Claim 3 (depends on 1)

The method of claim 1, further comprising:
deleting the one of the plurality of data structures.

### Claim 4 (depends on 1)

The method of claim 1, wherein the generating is responsive to adding a storage node to the storage cluster.

### Claim 5 (depends on 1)

The method of claim 1, further comprising:
reprocessing metadata of the one of the plurality of data structure into metadata for respective child data structure.

### Claim 6 (depends on 1)

The method of claim 1, wherein at least one of the storage nodes comprises a plurality of flash memory devices with differing capacities.

### Claim 7 (depends on 1)

The method of claim 1, wherein the generating and the assigning do not require moving the data.

### Claim 8

A tangible, non-transitory, computer-readable media having instructions thereupon which, when executed by a processing device, cause the processing device to perform a method comprising:
distributing data throughout storage nodes of a storage cluster in cooperation with a plurality of data structures in the storage cluster, wherein respective data structures have ownership of a range of the data;
generating at least two child data structures from one of the plurality of data structures; and
assigning a first subset of the data associated with the one of the plurality of data structures to a first child data structure, and a second subset of the data associated with the one of the plurality of data structures to a second child data structure.

### Claim 9 (depends on 8)

The computer readable media of claim 8, wherein one of the at least two child data structures remains in a same storage node as the parent data structure.

### Claim 10 (depends on 8)

The computer readable media of claim 8, further comprising:
deleting the one of the plurality of data structures.

### Claim 11 (depends on 8)

The computer readable media of claim 8, wherein the generating is responsive to adding a storage node to the storage cluster.

### Claim 12 (depends on 8)

The computer readable media of claim 8, further comprising:
reprocessing metadata of the one of the plurality of data structure into metadata for respective child data structure.

### Claim 13 (depends on 8)

The computer readable media of claim 8, wherein at least one of the storage nodes comprises a plurality of flash memory devices with differing capacities.

### Claim 14 (depends on 8)

The computer readable media of claim 8, wherein the generating and the assigning do not require moving the data.

### Claim 15

A storage cluster, comprising:
a plurality of storage nodes having storage memory, at least one of the plurality of storage nodes having a processing device configured to perform:
distribute data throughout storage nodes of a storage cluster in cooperation with a plurality of data structures in the storage cluster, wherein respective data structures have ownership of a range of the data;
generate at least two child data structures from one of the plurality of data structures; and
assign a first subset of the data associated with the one of the plurality of data structures to a first child data structure, and a second subset of the data associated with the one of the plurality of data structures to a second child data structure.

### Claim 16 (depends on 15)

The storage cluster of claim 15, wherein one of the at least two child data structures remains in a same storage node as the parent data structure.

### Claim 17 (depends on 15)

The storage cluster of claim 15, wherein the processing device is further configured to perform:
delete the one of the plurality of data structures.

### Claim 18 (depends on 15)

The storage cluster of claim 15, wherein the generating is responsive to adding a storage node to the storage cluster.

### Claim 19 (depends on 15)

The storage cluster of claim 15, wherein at least one of the storage nodes comprises a plurality of flash memory devices with differing capacities.

### Claim 20 (depends on 15)

The storage cluster of claim 15, wherein the generating and the assigning do not require moving the data.
