Extreme Binning: Scalable, parallel deduplication for chunk-based file backup

By Deepavali Bhagwat, Kave Eshghi, Darrell D. E. Long, Mark Lillibridge. 2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems, 2009

368 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

ChunkStash: Speeding Up Inline Storage Deduplication Using Flash Memory (2010, background): “When little or no chunk locality is present, the authors recommend an approach based on file similarity [12] that achieves significantly better deduplication quality.”
iDedup: latency-aware, inline data deduplication for primary storage (2012, background): “Even though much previous work has explored optimizing metadata management for inline, secondary systems (e.g., [2] [15] [21] [39] [41]), we feel that it is necessary to minimize all extra IO in the critical path for latency sensitive workloads.”
CAFTL: A Content-Aware Flash Translation Layer Enhancing the Lifespan of Flash Memory based Solid State Drives (2011, background): “CAFTL shares the same principle of removing data redundancy with Content-Addressable Storage (CAS), e.g. [11] [24] [30] [45] [47], which is designed for backup/archival systems.”
A study of practical deduplication (2011, methodology): “Initially, the interest in deduplication has centered on its use in embarrassingly compressible scenarios, such as regular full backups [Bhagwat et al. 2009; Dorward and Quinlan 2002] or virtual desktops [Clements et al. 2009; Jin and Miller 2009].”
A Comprehensive Study of the Past, Present, and Future of Data Deduplication (2016, methodology): “Thus, some systems resolve this problem by checking the content [60], [187] after a compare-by-hash.”