Data Chunking Algorithm Based on Byte-fingerprint Extremum Characteristics
Yuhua Li · Jisuanji gongcheng · 2010
Aiming at the problem that the Basic Sliding Window(BSW) algorithm can not determine the maximal block length in the field of data storage,a kind of data chunking algorithm based on the extremum characteristic of byte-fingerprints is presented.It constructs the interval within allowed maximal chunk length next to the previous chunk,and defines the function F for the field radius of byte-fingerprint's extremum.By using the characteristics of the function F,it can determine the next block boundary in the maximum interval with the probability of 1.Experimental results prove that the algorithm can overcome the shortage that BSW window algorithm and some other block-based algorithm can not determine the length of the largest block.The complexity of the algorithm is O(n).