Smith Micro Software, Inc.

Serge Volkoff

Darryl Lovato

Mark Armour

Vladimir Semenyuk

Michael Paul Halpin

A system and method for a block based differencing algorithm which includes the ability to limit memory requirements regardless of source file sizes by splitting the source file into optimally sized blocks. The invention allows the blocks to be processed in any order allowing in-place operation. Further, the present invention allows a second stage compressor to match the compressor blocks to those used by the differencing algorithm to optimize compressor and decompressor performance.

Block-based differencing algorithm

A method of compressing sorted data representation symbols sequentially. Steps include determining whether a symbol currently being encoded is identical to an immediately preceding symbol; encoding the result as a binary event; if the symbols are identical, encoding the symbol ends; if the symbols are different and there is a constant difference between several previous pairs of symbols, determining whether the difference between the current symbol a and the symbol immediately preceding it b is the same as the difference between the symbol b and the symbol immediately preceding it c, and encoding the determination result as another binary event; in the case of positive result of the latest determination, encoding the symbol ends; otherwise, encoding the symbol using a bitwise operation in which bits of the symbol's binary representation are processed sequentially from the most significant bit to the least significant bit. A corresponding decompression method is provided.

Efficient compression method for sorted data representations

A method of separating data blocks with stationary informational characteristics, including the steps of sequentially collecting statistics for small data blocks in an input data set, calculating the relative change in the estimated compression efficiency for a solid block currently being formed caused by merging its statistics with the statistics of a next small block, deciding whether the small block should be added to the solid block; for any block for which the decision is no, the block is used as the starting block of the next solid block to be formed. Auxiliary block data type detection is used to improve the method.

Advanced solid block splitting for lossless data compression

A method to efficiently detect, store, modify, and recreate fully or partially duplicate file forks is described. During archive creation or modification, sets of fully or partially duplicate forks are detected and a reduced number of transformed forks or fork segments are stored. During archive expansion, one or more forks are recreated from each full or partial copy.

Efficient full or partial duplicate fork detection and archiving

A system and method for the detection, compression, and decompression of previously compressed data that resides in data or files of an unknown data or file format.

Growing community of inventors

San Bruno, CA, United States of America

Serge Volkoff