Fetching Query Results Through Cloud Object Stores
US-2024394271-A1 · Nov 28, 2024 · US
US9451025B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9451025-B2 |
| Application number | US-201414287401-A |
| Country | US |
| Kind code | B2 |
| Filing date | May 27, 2014 |
| Priority date | Jul 31, 2013 |
| Publication date | Sep 20, 2016 |
| Grant date | Sep 20, 2016 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method includes encoding input data into a plurality of slices. The plurality of slices are sent to a plurality of distributed storage and task execution units for storage, the plurality of distributed storage and task execution units being located at a corresponding plurality of sites A storage failure is detected corresponding to at least one of the plurality of slices corresponding to at least one of the plurality of the distributed storage and task execution units and at least one of the corresponding plurality of sites A foster storage approach is determined. At least one alternative distributed storage and task execution unit is selected in accordance with the foster storage approach. At least one foster slice is generated corresponding to the at least one of the plurality of slices. The at least one foster slice is sent to the at least one alternative distributed storage and task execution unit.
Opening claim text (preview).
What is claimed is: 1. A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), the method comprises: encoding a data segment of input data into a plurality of encoded data slices; sending the plurality of encoded data slices to a plurality of distributed storage and task execution units for storage, the plurality of distributed storage and task execution units being located at a plurality of sites; detecting a storage failure corresponding to at least one of the plurality of encoded data slices corresponding to at least one of the plurality of the distributed storage and task execution units; determining a performance optimized mode or a reliability optimized mode as a foster storage approach; selecting at least one alternative distributed storage and task execution unit in accordance with the foster storage approach; generating at least one foster encoded data slice corresponding to the at least one of the plurality of encoded data slices; and sending the at least one foster encoded data slice to the at least one alternative distributed storage and task execution unit. 2. The method of claim 1 wherein, when the foster storage approach corresponds to the performance optimized mode, the at least one alternative distributed storage and task execution unit is located in at least one of the plurality of sites. 3. The method of claim 1 wherein, when the foster storage approach corresponds to the reliability optimized mode, the at least one alternative distributed storage and task execution unit is located in at an alternative site than the plurality of sites. 4. The method of claim 1 further comprising: updating slice location information corresponding to the data segment of the input data when the at least one foster encoded data slice is successfully stored in the at least one alternative distributed storage and task execution unit. 5. The method of claim 1 wherein detecting a storage failure corresponding to at least one of the plurality of encoded data slices includes at least one of: detecting at least one device failure in the at least one of the plurality of the distributed storage and task execution units; and detecting at least one communication failure to the at least one of the plurality of the distributed storage and task execution units. 6. The method of claim 1 wherein the foster storage approach is determined based on at least one of: a predetermined mode selection; a vault identifier, a data type corresponding to the input data, an estimated time of storage of the input data, an estimated frequency of retrieval of the input data, a reliability requirement of the input data, and a retrieval performance requirement of the input data. 7. A dispersed storage and task (DST) processing unit comprises: at least one module, when operable within a computing device, that causes the computing device to: encode a data segment of input data into a plurality of encoded data slices; send the plurality of encoded data slices to a plurality of distributed storage and task execution units for storage, the plurality of distributed storage and task execution units being located at a plurality of sites; detect a storage failure corresponding to at least one of the plurality of encoded data slices corresponding to at least one of the plurality of the distributed storage and task execution units; determine a performance optimized mode or a reliability optimized mode as a foster storage approach; select at least one alternative distributed storage and task execution unit in accordance with the foster storage approach; generate at least one foster encoded data slice corresponding to the at least one of the plurality of encoded data slices; and send the at least one foster encoded data slice to the at least one alternative distributed storage and task execution unit. 8. The DST processing unit of claim 7 wherein, when the foster storage approach corresponds to the performance optimized mode, the at least one alternative distributed storage and task execution unit is located in at least one of the plurality of sites. 9. The DST processing unit of claim 7 wherein, when the foster storage approach corresponds to the reliability optimized mode, the at least one alternative distributed storage and task execution unit is located in at least one alternative site that is disassociated from the plurality of sites. 10. The DST processing unit of claim 7 wherein the at least one module, when operable within a computing device, further causes the computing device to: update slice location information corresponding to the data segment of the input data when the at least one foster encoded data slice is successfully stored in the at least one alternative distributed storage and task execution unit. 11. The DST processing unit of claim 7 wherein detecting a storage failure corresponding to at least one of the plurality of encoded data slices includes at least one of: detecting at least one device failure in the at least one of the plurality of the distributed storage and task execution units; and detecting at least one communication failure to the at least one of the plurality of the distributed storage and task execution units. 12. The DST processing unit of claim 7 wherein the foster storage approach is determined based on at least one of: a predetermined mode selection; a vault identifier, a data type corresponding to the input data, an estimated time of storage of the input data, an estimated frequency of retrieval of the input data, a reliability requirement of the input data, and a retrieval performance requirement of the input data. 13. A non-transitory computer readable storage medium comprises: at least one memory section that stores operational instructions that, when executed by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), causes the one or more computing devices to: encode a data segment of input data into a plurality of encoded data slices; send the plurality of encoded data slices to a plurality of distributed storage and task execution units for storage, the plurality of distributed storage and task execution units being located at a plurality of sites; detect a storage failure corresponding to at least one of the plurality of encoded data slices corresponding to at least one of the plurality of the distributed storage and task execution units; determine a performance optimized mode or a reliability optimized mode as a foster storage approach; select at least one alternative distributed storage and task execution unit in accordance with the foster storage approach; generate at least one foster encoded data slice corresponding to the at least one of the plurality of encoded data slices; and send the at least one foster encoded data slice to the at least one alternative distributed storage and task execution unit. 14. The non-transitory computer readable storage medium of claim 13 wherein, when the foster storage approach corresponds to the performance optimized mode, the at least one alternative distributed storage and task execution unit is located in at least one of the plurality of sites. 15. The non-transitory computer readable storage medium of claim 13 wherein, when the foster storage approach corresponds to the reliability optimized mode, the at least one alternative distributed storage and task execution unit is located in at least one alternative site that is disassociated from the plurality of sites. 16. The non-transitory computer readable
Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS] · CPC title
Improving or facilitating administration, e.g. storage management · CPC title
Replication mechanisms · CPC title
Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues · CPC title
Rebuilding, e.g. when physically replacing a failing disk · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.