An efficient enhanced prefix hash tree model for optimizing the storage and image deduplication in cloud. (5th August 2022)

• Record Type: Journal Article
• Authors: Sujatha, G; Jeberson Retnaraj, R
• Is Part Of: Concurrency and computation. Volume 34:Number 23(2022)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2022-08-05
• Subjects: cloud storage space -- deduplication -- digital data -- hash value -- images -- public cloud; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.7199
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: The popularity of the cloud storage space mainly attracted organizations to store their data in them. Therefore, the avoidance of duplicate data contents is unavoidable and several users share the cloud storage space for data storage, and sometimes this makes higher storage space utilization. Because of the extremely high duplicate copy, memory wastage arises in the case of multimedia data. Identifying the final duplicate copies in the cloud takes more time. To overcome this problem, we employ a significant storage optimization model for deduplication. The digital data hash value is stored by requiring an additional memory space. This study proposed an enhanced prefix hash tree (EPHT) method to optimize the image and text deduplication system to reduce the overhead caused by this procedure. The efficiency of the proposed approach is compared with the interpolation search technique using different levels of tree height (2, 4, 2, 8, 16) in terms of space and time complexity. The proposed EPHT technique shows improvements in terms of speed and space complexity when the number of levels in the EPHT increases.