Patent application number | Description | Published |
20120330904 | EFFICIENT FILE SYSTEM OBJECT-BASED DEDUPLICATION - In accordance with one or more embodiments, an inode implemented file system may be utilized to support both offline and inline deduplication. When the first content is stored in the storage medium, one inode is used to associate a filename with the data blocks where the first content is stored. When a second content that is a duplicate of the first content is to be stored, then a parent inode is created to point to the data blocks in which a copy of the first content is stored. Further, two inodes are created, one representing the first content and the other representing the second content. Both inodes point to the same parent inode that points to the data blocks where the first content is stored. | 12-27-2012 |
20130054540 | FILE SYSTEM OBJECT-BASED DEDUPLICATION - Systems and methods for optimizing deduplication in a data storage system are provided. The method comprises associating a first name with first data blocks including first content stored in a data storage system, wherein the first name is associated with the first data blocks by way of a reference to a first meta file that points to a data file which points to the first data blocks; storing a first signature derived from the first content in an indexing data structure, wherein the first signature is used to associate the first name with the first data blocks and as means to verify whether a second content is a duplicate of the first content, based on value of a second signature derived from the second content. | 02-28-2013 |
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 |
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 |
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 |
20150229326 | BOOSTING DECOMPRESSION IN THE PRESENCE OF REOCCURRING HUFFMAN TREES - For boosting decompression in the presence of reoccurring Huffman trees, a previous Huffman tree is used to decompress a new data block if a match is identified between a compacted description of the Huffman tree and a recently used Huffman tree compaction. | 08-13-2015 |