Utilizing tree storage structures in a dispersed storage network

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

receiving a slice write request via a network that includes a data slice;

extracting metadata from the data slice; and

storing the metadata in a metadata storage tree in a first memory device of the DST execution unit and storing the data slice at a location associated with the metadata in a slice storage tree in a second memory device of the DST execution unit based on tree utilization parameters, wherein the first memory device has a higher performance level than the second memory device based on the tree utilization parameters indicating that metadata is stored in higher performance memory than data slices.

2. The method of claim 1 , further comprising:

comparing a tree utilization threshold to a slice tree utilization level associated with the slice storage tree; and

updating the tree utilization parameters by selecting a third memory device to store a third storage tree when tree utilization threshold compares unfavorably to the slice tree utilization level.

3. The method of claim 1 , wherein the first memory device has a lower performance level than the second memory device based on the tree utilization parameters indicating that metadata is stored in lower performance memory than data slices.

4. The method of claim 1 , wherein the first memory device includes solid-state memory, and wherein the second memory device includes magnetic drive memory.

5. The method of claim 1 , further comprising:

generating the tree utilization parameters by selecting the first memory device to store the metadata storage tree and selecting the second memory device to store the slice storage tree;

generating an initial metadata storage tree structure in the first memory; and

generating an initial slice storage tree structure in the second memory.

6. The method of claim 5 , wherein generating the tree utilization parameters further includes selecting a first plurality of memory devices to store a plurality of metadata storage trees and selecting a second plurality of memory devices to store a plurality of slice storage trees.

7. The method of claim 6 , further comprising selecting the first memory device from the first plurality of memory devices to store the extracted metadata and selecting the second memory device from the second plurality of memory devices to store the received data slice based on the tree utilization parameters.

8. The method of claim 1 , further comprising:

comparing a tree utilization threshold to a metadata tree utilization level associated with the metadata storage tree; and

updating the tree utilization parameters by selecting a third memory device to store a third storage tree when tree utilization threshold compares unfavorably to the metadata tree utilization level.

9. The method of claim 8 , wherein the third memory device includes a highest performing memory type, and wherein the third memory device is selected based on the highest performing memory type.

10. The method of claim 1 , wherein metadata entries of the metadata storage tree include a tree address corresponding to a location of the corresponding data slice in the slice storage tree.

11. A processing system of a dispersed storage and task (DST) execution unit comprises:

at least one processor;

a memory that stores operational instructions, that when executed by the at least one processor cause the processing system to:

receive a slice write request via a network that includes a data slice;

extract metadata from the data slice; and

store the metadata in a metadata storage tree in a first memory device of the DST execution unit and store the data slice at a location associated with the metadata in a slice storage tree in a second memory device of the DST execution unit based on tree utilization parameters, wherein the first memory device has a higher performance level than the second memory device based on the tree utilization parameters indicating that metadata is stored in higher performance memory than data slices.

12. The processing system of claim 11 , wherein the operational instructions, when executed by the at least one processor, further cause the processing system to:

compare a tree utilization threshold to a slice tree utilization level associated with the slice storage tree; and

update the tree utilization parameters by selecting a third memory device to store a third storage tree when tree utilization threshold compares unfavorably to the slice tree utilization level.

13. The processing system of claim 11 , wherein the first memory device has a lower performance level than the second memory device based on the tree utilization parameters indicating that metadata is stored in lower performance memory than data slices.

14. The processing system of claim 11 , wherein the first memory device includes solid-state memory, and wherein the second memory device includes magnetic drive memory.

15. The processing system of claim 11 , wherein the operational instructions, when executed by the at least one processor, further cause the processing system to:

generate the tree utilization parameters by selecting the first memory device to store the metadata storage tree and selecting the second memory device to store the slice storage tree;

generate an initial metadata storage tree structure in the first memory; and

generate an initial slice storage tree structure in the second memory.

16. The processing system of claim 15 , wherein generating the tree utilization parameters further includes selecting a first plurality of memory devices to store a plurality of metadata storage trees and selecting a second plurality of memory devices to store a plurality of slice storage trees.

17. The processing system of claim 16 , further comprising selecting the first memory device from the first plurality of memory devices to store the extracted metadata and selecting the second memory device from the second plurality of memory devices to store the received data slice based on the tree utilization parameters.

18. The processing system of claim 11 , wherein the operational instructions, when executed by the at least one processor, further cause the processing system to:

compare a tree utilization threshold to a metadata tree utilization level associated with the metadata storage tree; and

update the tree utilization parameters by selecting a third memory device to store a third storage tree when tree utilization threshold compares unfavorably to the metadata tree utilization level.

19. The processing system of claim 18 , wherein the third memory device includes a highest performing memory type, and wherein the third memory device is selected based on the highest performing memory type.

20. A non-transitory computer readable storage medium comprises:

at least one memory section that stores operational instructions that, when executed by a processing system of a dispersed storage network (DSN) that includes a processor and a memory, causes the processing system to:

receive a slice write request via a network that includes a data slice;

extract metadata from the data slice; and

store the metadata in a metadata storage tree in a first memory device and store the data slice at a location associated with the metadata in a slice storage tree in a second memory device based on tree utilization parameters, wherein the first memory device has a higher performance level than the second memory device based on the tree utilization parameters indicating that metadata is stored in higher performance memory than data slices.