Content-dependent chunking for differential compression, the local maximum approach
DOI10.1016/J.JCSS.2009.06.004zbMATH Open1201.68015OpenAlexW1976024527MaRDI QIDQ972380FDOQ972380
Andreas Blass, Nikolaj Bjørner, Yuri Gurevich
Publication date: 25 May 2010
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2009.06.004
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
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Algorithms on Strings, Trees and Sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient randomized pattern-matching algorithms
- Title not available (Why is that?)
- A fast algorithm for computing longest common subsequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compactly encoding unstructured inputs with differential compression
- The Problem of Learning to Teach
Cited In (1)
Uses Software
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)