R&D: Distributed Storage Hash Algorithm for File-Based De-Dupe in Cloud Computing

Springer Nature Switzerland AG. has published, in ICCNCT 2019: Second International Conference on Computer Networks and Communication Technologies proceedings, (Part of the Lecture Notes on Data Engineering and Communications Technologies book series (LNDECT, volume 44) an article written by S. Hema, and A. Kangaiammal, Government Arts College (Autonomous), Salem, India.

Abstract: “Increasing volume of digital data in cloud storage demands more storage space and efficient technique to handle these data. Duplicate is unavoidable while handling huge volume of data. Data Deduplication is an efficient approach in cloud storage environment that utilizes different techniques to deal with duplicate data. Existing systems generate the hash value by using any kind of cryptographic hash algorithms such as MD5 or Secure hash algorithms to implement the De-duplication approach. These algorithms produce fixed length of 128 bit or 160 bit as output respectively in order to identify the presence of duplication. So, an additional memory space is used to store this hash value. In this paper, an efficient Distributed Storage Hash Algorithm (DSHA) has been proposed to lessen the memory space occupied by the hash value which is utilized to identify and discard redundant data in cloud. Experimental analysis shows that the proposed strategy, reduces memory utilization of hash value and improves data read/write performance.“