Rolling Hash - Content Based Slicing Using Rabin-Karp Hash

Content Based Slicing Using Rabin-Karp Hash

One of the interesting use cases of the rolling hash function is that it can create dynamic, content-based chunks of a stream or file. This is especially useful when it is required to send only the changed chunks of a large file over a network and a simple byte addition at the front of the file would cause all the fixed size windows to become updated, while in reality, only the first ‘chunk’ has been modified.

The simplest approach to calculate the dynamic chunks is to calculate the rolling hash and if it matches a pattern (like the lower N bits are all zeroes) then it’s a chunk boundary. This approach will ensure that any change in the file will only affect it’s current and possibly the next chunk, but nothing else.

When the boundaries are known, the chunks need to be compared by their hash values to detect which one was modified and needs transfer across the network.

Read more about this topic:  Rolling Hash

Famous quotes containing the words content and/or based:

    Crude men who feel themselves insulted tend to assess the degree of insult as high as possible, and talk about the offense in greatly exaggerated language, only so they can revel to their heart’s content in the aroused feelings of hatred and revenge.
    Friedrich Nietzsche (1844–1900)

    The trouble with this country is that there are too many politicians who believe, with a conviction based on experience, that you can fool all of the people all of the time.
    Franklin Pierce Adams (1881–1960)