Emc IP Holding Company LLC

Alon Titelman

Uri Shabi

Ronen Gazit

Alex Soukhman

Alexei Kabishcer

Techniques for data processing may include: receiving a page P having a binary representation; determining a plurality of features for the page P; determining a plurality of feature hashes for the plurality of features, wherein each of the plurality of feature hashes corresponds to a different one of the plurality of features, wherein said each feature hash is determined using a hash function and in accordance with said different one of the plurality of features and an index associated with said different one of the plurality of features; and determining, in accordance with the plurality of feature hashes for the plurality of features, a similarity hash for the page P.

Similarity hash for binary data pages

Techniques for data processing may include: receiving a data block P having a binary representation; determining features for the data block P; determining, using at least one table of precomputed hash values, feature hashes for the features, wherein each of the feature hashes corresponds to a different feature, wherein each of the feature hashes is one of the precomputed hash values of the at least one table; and determining, in accordance with the feature hashes, a similarity hash for the data block P. Each feature may be a byte of P. The at least one table may be a single 3 dimensional or multiple 2 dimensional tables. Each row of a table of precomputed hash values may correspond to a single precomputed hash value. The row may include byte entries where each byte entry includes a single bit value of a precomputed hash.

Techniques for efficiently determining similarity hashes

A technique for performing deduplication traverses a deduplication database and assigns digest values in the database to buckets, where each bucket covers a respective range of digest values. To deduplicate a particular candidate block, the technique generates a digest from the candidate block and searches for the computed digest in a subset of the buckets, where the subset is selected based on the computed digest. If a target block providing an exact match or a suitably close partial match is found in the subset of buckets, the technique effects storage of the candidate block at least in part by providing a reference to the target block.

Growing community of inventors

Herzliya, Israel

Alon Titelman