Hash challenges: stretching the limits of compare-by-hash in distributed data deduplication

DOI10.1016/J.IPL.2012.01.012MaRDI QIDQ436334zbMATH OpenOpenAlexFDO

Authors João Barreto, Luís Veiga, Paulo Ferreira

Publication date 20 July 2012

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.7549

zbMATH Keywords

distributed systemscompare-by-hashdata deduplicationdistributed file systems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Optimal partitioning of data chunks in deduplication systems
• Dynamic determination of variable sizes of chunks in a deduplication system
• Similarity based deduplication with small data chunks
• Content-dependent chunking for differential compression, the local maximum approach
• Less Hashing, Same Performance: Building a Better Bloom Filter

Cites work

• A probabilistic distributed algorithm for set intersection and its analysis
• The Probabilistic Communication Complexity of Set Intersection

Cited in

(3)

• Dynamic determination of variable sizes of chunks in a deduplication system
• Optimal partitioning of data chunks in deduplication systems
• DARE: A Deduplication-Aware Resemblance Detection and Elimination Scheme for Data Reduction with Low Overheads

This page was built for publication: Hash challenges: stretching the limits of compare-by-hash in distributed data deduplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436334)