Publication Date
2009
Degree Type
Master's Project
Degree Name
Master of Science (MS)
Department
Computer Science
Abstract
Chunking algorithms play an important role in data de-duplication systems. The Basic Sliding Window (BSW) algorithm is the first prototype of the content-based chunking algorithm which can handle most types of data. The Two Thresholds Two Divisors (TTTD) algorithm was proposed to improve the BSW algorithm in terms of controlling the variations of the chunk-size. In this project, we investigate and compare the BSW algorithm and TTTD algorithm from different factors by a series of systematic experiments. Up to now, no paper conducts these experimental evaluations for these two algorithms. This is the first value of this paper. According to our analyses and the results of experiments, we provide a running time improvement for the TTTD algorithm. Our new solution reduces about 7 % of the total running time and also reduces about 50 % of the large-sized chunks while comparing with the original TTTD algorithm and make average chunk-size closer to the expected chunk-size. These significant results are the second important value of this project.
Recommended Citation
Chang, BingChun, "A Running Time Improvement for Two Thresholds Two Divisors Algorithm" (2009). Master's Projects. 42.
DOI: https://doi.org/10.31979/etd.xeqs-v4ft
https://scholarworks.sjsu.edu/etd_projects/42
