2010 · 79 citations · 23 references
ComputingComputer EngineeringComputer ScienceData ManagementDatabasesStorage SystemsData DeduplicationData RedundancyData Storage SystemsDisk Storage SystemsSolid-state Drive ArchitectureSolid-state StorageBlock-level DeduplicationData Path DesignInline DeduplicationMain Memory OrganizationRandom Access PerformanceRedundant Data StorageSequential OperationsSolid-state Drives
Data deduplication systems discover and remove redundancies between data blocks. The search for redundant data blocks is often based on hashing the content of a block and comparing the resulting hash value with already stored entries inside an index. The limited random IO performance of hard disks limits the overall throughput of such systems, if the index does not fit into main memory. This paper presents the architecture of the dedupv1 dedupli-cation system that uses solid-state drives (SSDs) to improve its throughput compared to disk-based systems. dedupv1 is designed to use the sweet spots of SSD technology (random reads and sequential operations), while avoiding random writes inside the data path. This is achieved by using a hybrid deduplication design. It is an inline deduplication system as it performs chunking and fingerprinting online and only stores new data, but it is able to delay much of the processing as well as IO operations.
23
Introduction to information retrieval
Choice Reviews Online · 2009 · 12.6K citations
Space/time trade-offs in hash coding with allowable errors
Burton H. Bloom · Communications of the ACM · 1970 · 7.5K citations · Full text
The log-structured merge-tree (LSM-tree)
Patrick E. O׳Neil, E.T. Cheng, Dieter Gawlick et al. · Acta Informatica · 1996 · 1.3K citations
A low-bandwidth network file system
Athicha Muthitacharoen, Benjie Chen, David Mazières · 2001 · 786 citations