Dynamic data compression selection
US-10320415-B2 · Jun 11, 2019 · US
US10742232B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10742232-B2 |
| Application number | US-201916669966-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 31, 2019 |
| Priority date | Mar 6, 2015 |
| Publication date | Aug 11, 2020 |
| Grant date | Aug 11, 2020 |
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.
Aspects of dynamic data compression selection are presented. In an example method, as uncompressed data chunks of a data stream are compressed, at least one performance factor affecting selection of one of multiple compression algorithms for the uncompressed data chunks of the data stream may be determined. Each of the multiple compression algorithms may facilitate a different expected compression ratio. One of the multiple compression algorithms may be selected separately for each uncompressed data chunk of the data stream based on the at least one performance factor. Each uncompressed data chunk may be compressed using the selected one of the multiple compression algorithms for the uncompressed data chunk.
Opening claim text (preview).
The invention claimed is: 1. A method for data compression, the method comprising: receiving uncompressed source data at a data compression system from a data storage device, the uncompressed source data comprising a set of compressed data chunks; selecting a first compression algorithm to compress a first subset of the set of data chunks; compressing the first subset of the set of data chunks using the first compression algorithms; selecting a second compression algorithm to compress a second subset of the set of data chunks; compressing the second subset of the set of data chunks using the second compression algorithm; and transmitting the compressed first subset of the set of data chunks and the compressed second subset of the set of data chunks to a data target. 2. The method of claim 1 , wherein at least one of the first compression algorithm and the second compression algorithm is a lossless data compression algorithm. 3. The method of claim 1 , further comprising, prior to selecting the second compression algorithm: detecting a performance factor that characterizes a performance of a data source from which the uncompressed source data is received, a network or a data target to which compressed data chunks are to be delivered; wherein the second compression algorithm is selected based on the performance factor. 4. The method of claim 1 , further comprising, prior to selecting the second compression algorithm: detecting a factor that characterizes: a depth of a buffer or queue within a data source from which the uncompressed source data is received; or an availability metric of a resource of a data target to which compressed data chunks are to be delivered; wherein the second compression algorithm is selected based on the factor. 5. The method of claim 1 , wherein the first compression algorithm corresponds to a first compression ratio that is different than a second compression ratio to which the second compression ratio corresponds. 6. The method of claim 1 , further comprising, while receiving the data stream: iteratively storing the set of compressed data chunks in a buffer or data queue; wherein detecting each of the set of compressed data chunks includes, for each compressed data chunk of the set of compressed data chunks, retrieving the compressed data chunk from the buffer or data queue. 7. The method of claim 1 , wherein the set of compressed data chunks correspond to a data file, data file folder, data container or data structure. 8. A computer-program product tangibly embodied in a non-transitory machine-readable storage medium, including instructions configured to cause one or more data processors to perform actions including: receiving uncompressed source data at a data compression system from a data storage device, the uncompressed source data comprising a set of data chunks; selecting a first compression algorithm to compress a first subset of the set of data chunks; compressing the first subset of the set of data chunks using the first compression algorithm; selecting a second compression algorithm to compress a second subset of the set of data chunks; compressing the second subset of the set of data chunks using the second compression algorithm; and transmitting the compressed first subset of the set of data chunks and the compressed second subset of the set of data chunks to a data target. 9. The computer-program product of claim 8 , wherein at least one of the first compression algorithm and the second compression algorithm is a lossless data compression algorithm. 10. The computer-program product of claim 8 , wherein the actions further include, prior to selecting the second compression algorithm: detecting a performance factor that characterizes a performance of a data source from which the uncompressed source data is received, a network or a data target to which compressed data chunks are to be delivered; wherein the second compression algorithm is selected based on the performance factor. 11. The computer-program product of claim 8 , wherein the actions further include, prior to selecting the second compression algorithm: detecting a factor that characterizes: a depth of a buffer or queue within a data source from which the uncompressed source data is received; or an availability metric of a resource of a data target to which compressed data chunks are to be delivered; wherein the second compression algorithm is selected based on the factor. 12. The computer-program product of claim 8 , wherein the first compression algorithm corresponds to a first compression ratio that is different than a second compression ratio to which the second compression ratio corresponds. 13. The computer-program product of claim 8 , wherein the actions further include, while receiving the data stream: iteratively storing the set of compressed data chunks in a buffer or data queue; wherein detecting each of the set of compressed data chunks includes, for each compressed data chunk of the set of compressed data chunks, retrieving the compressed data chunk from the buffer or data queue. 14. The computer-program product of claim 8 , wherein the set of compressed data chunks correspond to a data file, data file folder, data container or data structure. 15. A system for data compression including: one or more data processors; and a non-transitory computer readable storage medium containing instructions which when executed on the one or more data processors, cause the one or more data processors to perform actions including: receiving uncompressed source data at a data compression system from a data storage device, the uncompressed source data comprising a set of data chunks; selecting a first compression algorithm to compress a first subset of the set of data chunks; compressing the first subset of the set of data chunks using the first compression algorithm; selecting a second compression algorithm to compress a second subset of the set of data chunks; compressing the second subset of the set of data chunks using the second compression algorithm; and transmitting the compressed first subset of the set of data chunks and the compressed second subset of the set of data chunks to a data target. 16. The system of claim 15 , wherein at least one of the first compression algorithm and the second compression algorithm is a lossless data compression algorithm. 17. The system of claim 15 , wherein the actions further include, prior to selecting the second compression algorithm: detecting a performance factor that characterizes a performance of a data source from which the uncompressed source data is received, a network or a data target to which compressed data chunks are to be delivered; wherein the second compression algorithm is selected based on the performance factor. 18. The system of claim 15 , wherein the actions further include, prior to selecting the second compression algorithm: detecting a factor that characterizes: a depth of a buffer or queue within a data source from which the uncompressed source data is received; or an availability metric of a resource of a data target to which compressed data chunks are to be delivered; wherein the second compression algorithm is selected based on the factor. 19. The system of claim 15 , wherein the first compression algorithm corresponds to a first compression ratio that is different than a second compression ratio to which the second compression ratio corresponds. 20. The system of claim 15 , wherein the act
Encoder aspects · CPC title
Selection strategies · CPC title
Selection between different types of compressors · CPC title
Compression (speech analysis-synthesis for redundancy reduction G10L19/00; for image communication H04N); Expansion; Suppression of unnecessary data, e.g. redundancy reduction · CPC title
according to reasons other than compression rate or data type · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.