Dynamic data compression selection
US-10116330-B2 · Oct 30, 2018 · US
US10511325B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10511325-B2 |
| Application number | US-201916388638-A |
| Country | US |
| Kind code | B2 |
| Filing date | Apr 18, 2019 |
| Priority date | Mar 6, 2015 |
| Publication date | Dec 17, 2019 |
| Grant date | Dec 17, 2019 |
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 decompression, the method comprising: receiving a data stream at data-target system from a single data source; detecting each of a set of compressed data chunks within the data stream; and for each compressed data chunk of at least some of the set of compressed data chunks: identifying a compression algorithm was used to compress the compressed data chunk, wherein the compression algorithm identified to have been used to compress a first compressed data chunk of the at least some of the set of compressed data chunks is a first compression algorithm that differs from a second compression algorithm identified to have been used to compress a second compressed data chunk of the at least some of the set of compressed data chunks; selecting a decompression algorithm based on the identified compression algorithm; and decompressing the compressed data chunk using the decompression algorithm. 2. The method of claim 1 , wherein an identity of the compression algorithm for data compression is correlated with at least one performance factor. 3. 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. 4. 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. 5. 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. 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 compression algorithm is identified based on an indication accompanying the compressed data chunk. 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 a data stream at data-target system from a single data source; detecting each of a set of compressed data chunks within the data stream; and for each compressed data chunk of at least some of the set of compressed data chunks: identifying a compression algorithm was used to compress the compressed data chunk, wherein the compression algorithm identified to have been used to compress a first compressed data chunk of the at least some of the set of compressed data chunks is a first compression algorithm that differs from a second compression algorithm identified to have been used to compress a second compressed data chunk of the at least some of the set of compressed data chunks; selecting a decompression algorithm based on the identified compression algorithm; and decompressing the compressed data chunk using the decompression algorithm. 9. The computer-program product of claim 8 , wherein an identity of the compression algorithm for data compression is correlated with at least one performance factor. 10. 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. 11. 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. 12. 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. 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 compression algorithm is identified based on an indication accompanying the compressed data chunk. 15. A system for data dcompression, the system comprising: 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 a data stream at data-target system from a single data source; detecting each of a set of compressed data chunks within the data stream; and for each compressed data chunk of at least some of the set of compressed data chunks: identifying a compression algorithm was used to compress the compressed data chunk, wherein the compression algorithm identified to have been used to compress a first compressed data chunk of the at least some of the set of compressed data chunks is a first compression algorithm that differs from a second compression algorithm identified to have been used to compress a second compressed data chunk of the at least some of the set of compressed data chunks; selecting a decompression algorithm based on the identified compression algorithm; and decompressing the compressed data chunk using the decompression algorithm. 16. The system of claim 15 , wherein an identity of the compression algorithm for data compression is correlated with at least one performance factor. 17. 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. 18. 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. 19. The system of claim 15 , wherein the set of compressed data chunks correspond to a data file, data file folder, data container or data structure. 20. The system of claim 15 , 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.
Selection strategies · 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
Encoder aspects · CPC title
Selection between different types of compressors · 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.