Sub-block partitioning for hash-based deduplication

摘要

Sub-block partitioning for hash-based deduplication is performed by defining a minimal size and maximum size of the sub-block. If one of a plurality of search criteria is satisfied by one of a plurality of hash values, declaring a position of the hash value as a boundary end position of the sub-block. If the maximum size of the sub-block is reached prior to satisfying one of the multiple search criteria, declaring a position of an alternative one of the hash values that is selected based upon another one of the multiple search criteria as the boundary end position of the sub-block. One of the plurality of search criteria is satisfied if n bits at predefined positions of a value calculated by applying an XOR operation on last calculated k hash values are equal to one of an mth predefined different patterns of bits.