Byte-index chunking algorithm for data deduplication system

8Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

This paper presents an algorithm and structure for a deduplication method which can be efficiently used for eliminating identical data between files existing different machines with high rate and performing it within rapid time. The algorithm predicts identical parts between source and destination files very fast, and then assures the identical parts and transfers only those parts of blocks that proved to be unique region. The fundamental aspect of reaching faster and high scalability determining duplicate result is that data are expressed as fixed-size block chunks which are distributed to "Index-table" by chunk's both side boundary values. "Index-table" is a fixed sized table structure; chunk's boundary byte values are used as their cell row and column numbers. Experiment result shows that the proposed solution enhances data deduplication performance and reduces data storage capacity extensively. © 2013 SERSC.

Cite

CITATION STYLE

APA

Lkhagvasuren, I., So, J. M., Lee, J. G., Yoo, C., & Ko, Y. W. (2013). Byte-index chunking algorithm for data deduplication system. International Journal of Security and Its Applications, 7(5), 415–424. https://doi.org/10.14257/ijsia.2013.7.5.38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free