In-place reconstructible delta compression using alleviated greedy matching algorithm

This paper introduces an efficient string matching algorithm for in-place reconstructible delta compression. Some algorithms for existing in-place reconstruction enable embedded systems with limited memory to create the new file version in the memory space that the current version file occupies. However these algorithms increase the size of the delta file transmitted over low-bandwidth channels, or increase the decoding complexity. To solve these problems, we developed alleviated greedy algorithm that creates the delta file for in-place reconstruction. The algorithm lowers decoding complexity and results in a smaller size of delta file than the existing in-place reconstruction algorithm. Delta size and required memory size for decoding in experiments are compared to an existing delta compression technique.