Optimal partitioning of data chunks in deduplication systems

DOI10.1016/J.DAM.2015.12.018MaRDI QIDQ313775zbMATH OpenOpenAlexFDO

Authors M. Hirsch, A. Ish-Shalom, Shmuel T. Klein

Publication date 12 September 2016

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2015.12.018

zbMATH Keywords

dynamic programmingdeduplicationpartitioning data chunks

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Dynamic determination of variable sizes of chunks in a deduplication system
• Similarity based deduplication with small data chunks
• Hash challenges: stretching the limits of compare-by-hash in distributed data deduplication
• Mobile sensor networks: system hardware and dispatch software
• Content-dependent chunking for differential compression, the local maximum approach

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• A universal algorithm for sequential data compression
• Similarity based deduplication with small data chunks

Cited in

(9)

• Hash challenges: stretching the limits of compare-by-hash in distributed data deduplication
• Multifile Partitioning for Record Linkage and Duplicate Detection
• Mobile sensor networks: system hardware and dispatch software
• Dynamic determination of variable sizes of chunks in a deduplication system
• A new data redundancy elimination algorithm based on Bloom filter data structure
• Similarity based deduplication with small data chunks
• Data deduplication
• Reliability provision mechanism for large-scale de-duplication storage systems
• Algorithms for multidimensional partitioning of static files

This page was built for publication: Optimal partitioning of data chunks in deduplication systems

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