HANDS: A Heuristically Arranged Non-Backup In-line Deduplication System

Appeared in Proceedings of the 29th IEEE International Conference on Data Engineering (ICDE 2013).

Abstract

Deduplicating in-line data on primary storage is hampered by the disk bottleneck problem, an issue which results from the need to keep an index mapping portions of data to hash values in memory in order to detect duplicate data without paying the performance penalty of disk paging. The index size is proportional to the volume of unique data, so placing the entire index into RAM is not cost effective with a deduplication ratio below 45%. HANDS reduces the amount of in-memory index storage required by up to 99% while still achieving between 30% and 90% of the deduplication a full memory-resident index provides, making primary deduplication cost effective in workloads with deduplication rates as low as 8%. HANDS is a framework that dynamically pre-fetches fingerprints from disk into memory cache according to working sets statistically derived from access patterns. We use a simple neighborhood grouping as our statistical technique to demonstrate the effectiveness of our approach. HANDS is modular and requires only spatio-temporal data, making it suitable for a wide range of storage systems without the need to modify host file systems.

Publication date:
April 2013

Authors:
Avani Wildani
Ethan L. Miller
Ohad Rodeh

Projects:
Deduplication
Prediction and Grouping

Available media

Full paper text: PDF

Bibtex entry

@inproceedings{wildani-icde13,
  author       = {Avani Wildani and Ethan L. Miller and Ohad Rodeh},
  title        = {{HANDS}: A Heuristically Arranged Non-Backup In-line Deduplication System},
  booktitle    = {Proceedings of the 29th IEEE International Conference on Data Engineering (ICDE 2013)},
  month        = apr,
  year         = {2013},
}