Proceedings ArticleDOI
Compressed Transitive Delta Encoding
Dana Shapira
- pp 203-212
Reads0
Chats0
TLDR
A new algorithm for solving CTDE is proposed and its compression performance is compared against the traditional ``double delta decompression''.Abstract:
Given a source file $S$ and two differencing files $\Delta (S,T)$ and $\Delta(T,R)$, where $\Delta(X,Y)$ is used to denote the delta file of the target file $Y$ with respect to the source file $X$, the objective is to be able to construct $R$.This is intended for the scenario of upgrading software where intermediate releases are missing, or for the case of file system backups, where non consecutive versions must be recovered.The traditional way is to decompress $\Delta(S,T)$ in order to construct$T$ and then apply $\Delta(T,R)$ on $T$ and obtain $R$.The {\it Compressed Transitive Delta Encoding (CTDE)} paradigm, introduced in this paper, is to construct a delta file $\Delta(S,R)$ working directly on the two given delta files, $\Delta (S,T)$ and $\Delta(T,R)$, without any decompression or the use of the base file $S$. A new algorithm for solving CTDE is proposed and its compression performance is compared against the traditional ``double delta decompression''.Not only does it use constant additional space, as opposed to the traditional method which uses linear additional memory storage, but experiments show that the size of the delta files involved is reduced by 15\% on average.read more
Citations
More filters
Journal ArticleDOI
Bidirectional delta files
Dana Shapira,Michael Kats +1 more
TL;DR: Two main strategies for producing an efficient bidirectional delta file in terms of the memory storage it requires are presented; a quadratic time, optimal, dynamic programming algorithm, and a linear time, greedy algorithm.
Proceedings ArticleDOI
Bidirectional Delta Files
Dana Shapira,Michael Kats +1 more
TL;DR: A greedy algorithm is designed, which produces an efficient bidirectional delta file in terms of the memory storage it requires, and experiments show memory storage savings of at least $25\%$ between the implemented algorithm and the traditional way of using both forwards and backwards delta files.
Posted Content
SSDFS: Towards LFS Flash-Friendly File System without GC operation.
TL;DR: SSDFS file system introduces several authentic concepts and mechanisms that are able to manage write amplification in smart way, decrease GC overhead, prolong SSD lifetime, and provide predictable file system's performance.
Proceedings ArticleDOI
Modified delta encoding and its applications to speech signal
TL;DR: A modified delta encoding method is proposed which has the potential to apply on data security for practical use because the delta encoding path which can be used as the security key is unordered and long enough.
Proceedings ArticleDOI
A Generic Workflow Engine for Iterative, Simulation-Based Non-Linear System Identifications
TL;DR: In this article, a generic process for simulation-based system identification for civil engineering problems is presented and implemented in a generic workflow engine that can be integrated into software systems and adapted to specific application scenarios.
References
More filters
Proceedings ArticleDOI
Linear pattern matching algorithms
TL;DR: A linear time algorithm for obtaining a compacted version of a bi-tree associated with a given string is presented and indicated how to solve several pattern matching problems, including some from [4] in linear time.
Journal ArticleDOI
The string-to-string correction problem with block moves
TL;DR: An algorithm that produces the shortest edit sequence transforming one string into another is presented and is optimal in the sense that it generates a minimal covering set of common substrings of one string with respect to another.
Journal ArticleDOI
Let Sleeping Files Lie
TL;DR: In this article, the authors consider pattern matching without decompression in the UNIX Z-compression scheme and show how to modify their algorithms to achieve a trade-off between the amount of extra space used and the algorithm's time complexity.
Journal ArticleDOI
Delta algorithms: an empirical analysis
TL;DR: Results indicate that modern delta compression algorithms based on Ziv-Lempel techniques significantly outperform diff, a popular but older delta compressor, in terms of compression ratio.
Journal ArticleDOI
String matching in Lempel-Ziv compressed strings
Martin Farach,Mikkel Thorup +1 more
TL;DR: This paper gives the first nontrivial compressed matching algorithm for the classic adaptive compression scheme, the LZ77 algorithm, which is known to compress more than other dictionary compression schemes, such as LZ78 and LZW, though for strings with constant per bit entropy, all these schemes compress optimally in the limit.