Segmenting and merging data in a dispersed storage network

A processing system of a dispersed storage and task (DST) processing unit comprising:

• 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 first independent data element (IDE) for storage;
• determine a first optimal slice size requirement for the first IDE;
• determine to split the first IDE based on determining the first IDE compares unfavorably to the first optimal slice size requirement;
• select at least one split location of the first IDE based on the first optimal slice size requirement;
• split continuous content of the first IDE into a first plurality of IDEs in accordance with the at least one split location;
• perform a dispersed storage error coding function on each of the first plurality of IDEs to produce a set of encoded slices for each of the first plurality of IDEs, wherein encoded slices of each set of encoded slices compare favorably to the first optimal slice size requirement;
• transmit, via a network, each set of encoded slices to a corresponding set of storage units for storage;
• receive a set of additional IDEs for storage;
• determine a second optimal slice size requirement for at least one of the set of additional IDEs;
• determine to merge the set of additional IDEs into at least one merged IDE based on determining the set of additional IDEs compare unfavorably to the second optimal slice size requirement;
• select a subset of the set of additional IDEs based on the second optimal slice size requirement to be merged into a merged IDE;
• concatenate continuous content of the subset of the set of additional IDEs to produce the merged IDE;
• perform the dispersed storage error coding function on the merged IDE to produce a second set of encoded slices for the merged IDE, wherein encoded slices of the second set of encoded slices compare favorably to the second optimal slice size requirement;
• and
• transmit, via the network, the second set of encoded slices to a second corresponding set of storage units for storage.

A computer readable storage medium comprising:

• a computer readable memory including one or more memory elements that include 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 first independent data element (IDE) for storage;
• determine a first optimal slice size requirement for the first IDE;
• determine to split the first IDE based on determining the first IDE compares unfavorably to the first optimal slice size requirement;
• select at least one split location of the first IDE based on the first optimal slice size requirement;
• split continuous content of the first IDE into a first plurality of IDEs in accordance with the at least one split location;
• perform a dispersed storage error coding function on each of the first plurality of IDEs to produce a set of encoded slices for each of the first plurality of IDEs, wherein encoded slices of each set of encoded slices compare favorably to the first optimal slice size requirement;
• transmit, via a network, each set of encoded slices to a corresponding set of storage units for storage;
• receive a set of additional IDEs for storage;
• determine a second optimal slice size requirement for at least one of the set of additional IDEs;
• determine to merge the set of additional IDEs into at least one merged IDE based on determining the set of additional IDEs compare unfavorably to the second optimal slice size requirement;
• select a subset of the set of additional IDEs based on the second optimal slice size requirement to be merged into a merged IDE;
• concatenate continuous content of the subset of the set of additional IDEs to produce the merged IDE;
• perform the dispersed storage error coding function on the merged IDE to produce a second set of encoded slices for the merged IDE, wherein encoded slices of the second set of encoded slices compare favorably to the second optimal slice size requirement;
• and
• transmit, via the network, the second set of encoded slices to a second corresponding set of storage units for storage.