Data deduplication using a small hash table

作者: Araki Hiroshi , Hasegawa Tohru

DOI:

关键词: Computer scienceRolling hashParallel computingHash functionHash filterHash treeDouble hashingHash listHash chainHash buster

摘要: Embodiments of the present invention provide methods, systems, and computer program products for data deduplication. In one embodiment, a chunk, it is determined whether hash value chunk generated by first function in table. Once threshold size table reached, there free space write area, identified second function. When no post-deduplication process performed each area. cleared written to area

参考文章(13)
Sudipta Sengupta, Biplob Debnath, Jin Li, ChunkStash: speeding up inline storage deduplication using flash memory usenix annual technical conference. pp. 16- 16 ,(2010)
John T. Olson, Duane Mark Baldwin, Nilesh Prabhakar Bhosale, Sandeep Ramesh Patil, Increased in-line deduplication efficiency ,(2012)
Ulf Troppens, Harald Seipp, Daniel J. Winarski, Nils Haustein, Integrity checking and selective deduplication based on network parameters ,(2013)
Sudipta Sengupta, James Robert Benton, Ronakkumar N. Desai, Paul Adrian Oltean, Ran Kalach, Jin Li, Using index partitioning and reconciliation for data deduplication ,(2011)
Roland S. Niles, Wai T. Lam, System and method for backing up data ,(2006)