A study on disk index design for large scale de–duplication storage systems. (1st January 2015)

• Record Type: Journal Article
• Authors: Yang, Tian–Ming; Feng, Dan; Chou, Wen–Kuang; Liu, Jing–Ning
• Is Part Of: International journal of computational science and engineering. Volume 10:Number 1/2(2015)
• Page Start: 171
• Page End: 180
• Publication Date: 2015-01-01
• Subjects: storage systems -- chunk–based de–duplication -- disk index -- hash tables -- deduping -- metadata storage -- hash table overflow -- access performance; Computer science -- Mathematics -- Periodicals; Computer simulation -- Mathematical aspects -- Periodicals; Computational intelligence -- Periodicals; 004.015105
• DOI: 10.1504/IJCSE.2015.067074
• Languages: English
• ISSNs: 1742-7185

Abstract

Chunk–based de–duplication storage, which aims to optimise the storage or bandwidth usage by eliminating the duplicate chunks in the inter–file level, has been attended broadly both in academia and industry recently. For a petabyte–scale de–duplication storage system, the metadata storage especially the disk index, which establishes a mapping between the fingerprints and corresponding chunks in the system, can reach terabyte–scale size. In this paper, we propose a disk–resident hash table to implement the disk index, and theoretically study yet extensively experiment the probability of hash table overflow. These studies help us design a space–efficient disk index which not only reduces metadata storage but also improves access performance.