Patent application number | Description | Published |
20140052699 | ESTIMATION OF DATA REDUCTION RATE IN A DATA STORAGE SYSTEM - Systems and methods for estimating data reduction ratio for a data set is provided. The method comprises selecting a plurality of m elements from a data set comprising a plurality of N elements; associating an identifier h | 02-20-2014 |
20140195497 | REAL-TIME IDENTIFICATION OF DATA CANDIDATES FOR CLASSIFICATION BASED COMPRESSION - Identification of data candidates for data processing is performed in real time by a processor device in a computing environment. Data candidates are sampled for performing a classification-based compression upon the data candidates. A heuristic is computed on a randomly selected data sample from the data candidate for determining if the data candidate may benefit from the classification-based compression. A decision is provided for approving the classification-based compression on the data candidates according to the heuristic. | 07-10-2014 |
20140195498 | REAL-TIME REDUCTION OF CPU OVERHEAD FOR DATA COMPRESSION - Real-time reduction of CPU overhead for data compression is performed by a processor device in a computing environment. Non-compressing heuristics are applied on a randomly selected data sample from data sequences for determining whether to compress the data sequences. A compression potential is calculated based on the non-compressing heuristics. The compression potential is compared to a threshold value. The data sequences are either compressed if the compress threshold is matched, compressed using Huffman coding if Huffman coding threshold is matched, or stored without compression. | 07-10-2014 |
20140195499 | REAL-TIME CLASSIFICATION OF DATA INTO DATA COMPRESSION DOMAINS - For real-time classification of data into data compression domains, a decision is made for which of the data compression domains write operations should be forwarded by reading randomly selected data of the write operations for computing a set of classifying heuristics thereby creating a fingerprint for each of the write operations. The write operations having a similar fingerprint are compressed together in a similar compression stream. | 07-10-2014 |
20140195500 | REAL-TIME IDENTIFICATION OF DATA CANDIDATES FOR CLASSIFICATION BASED COMPRESSION - Identification of data candidates for data processing is performed in real time by a processor device in a computing environment. Data candidates are sampled for performing a classification-based compression upon the data candidates. A heuristic is computed on a randomly selected data sample from the data candidate for determining if the data candidate may benefit from the classification-based compression. A decision is provided for approving the classification-based compression on the data candidates according to the heuristic. | 07-10-2014 |
20150058301 | EFFICIENT DATA DEDUPLICATION IN A DATA STORAGE NETWORK - Machines, systems and methods of uploading data files, the method comprising a first client machine dividing a first file into N data chunks to be uploaded to a server, wherein the N data chunks are of size kX, where k is an integer and X is size of a minimal size data chunk, wherein X is known by the server and by at least a second client machine used for uploading a second file to the server in data chunks of size k′X; and uploading the first file to the server, wherein a first unique signature is calculated for the first file based on applying a signature function to a collection of signatures calculated for the minimal size data chunks of size X that make up the data chunks of size kX in the first file, wherein the uploading of the first file is accomplished by uploading the data chunks of size kX to the server in any order. | 02-26-2015 |
20150109154 | BOOSTING DECOMPRESSION IN THE PRESENCE OF REOCCURRING HUFFMAN TREES - For boosting decompression in the presence of reoccurring Huffman trees, a compacted description of a Huffman tree is compared to recently used Huffman tree compactions for identifying matches rather than reconstructing a Huffman tree from a header of a compressed block for each data block to avoid overhead of a Huffman tree reconstruction. | 04-23-2015 |
20150113220 | EFFICIENT ONE-PASS CACHE-AWARE COMPRESSION - Exemplary method, system, and computer program product embodiments for efficient one-pass cache-aware compression are provided. In one embodiment, by way of example only, an output of a fast compressor to Huffman encoding for achieving the one-pass cache-aware compression by using a predetermined Huffman-tree upon determining by the fast compressor a final representation of each data byte. | 04-23-2015 |