Content-dependent chunking for differential compression, the local maximum approach
From MaRDI portal
Publication:972380
Recommendations
- Compactly encoding unstructured inputs with differential compression
- Direct merging of delta encoded files
- Compression in the presence of shared data
- A lossless compression algorithm for integer difference sequences by optimization of their division into intervals of constant bit depth values
- Dynamic determination of variable sizes of chunks in a deduplication system
Cites work
- scientific article; zbMATH DE number 5725179 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 1542661 (Why is no real title available?)
- scientific article; zbMATH DE number 3799981 (Why is no real title available?)
- scientific article; zbMATH DE number 5263622 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- A fast algorithm for computing longest common subsequences
- Algorithms on Strings, Trees and Sequences
- Compactly encoding unstructured inputs with differential compression
- Efficient randomized pattern-matching algorithms
- The Problem of Learning to Teach
Cited in
(5)- Compactly encoding unstructured inputs with differential compression
- Hash challenges: stretching the limits of compare-by-hash in distributed data deduplication
- Dynamic determination of variable sizes of chunks in a deduplication system
- Optimal partitioning of data chunks in deduplication systems
- Similarity based deduplication with small data chunks
This page was built for publication: Content-dependent chunking for differential compression, the local maximum approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972380)