Compressed Delta Encoding for LZSS Encoded Files

We explore the full compressed delta encoding problem in compressed texts, defined as the problem of constructing a delta file directly from the two given compressed files, without decompressing. We concentrate on the case where the given files are compressed using LZSS and propose solutions for the special cases involving substitutions only

[1]  Dana Shapira,et al.  In Place Differential File Compression , 2005, Comput. J..

[2]  Michael Factor,et al.  Software compression in the client/server environment , 2001, Proceedings DCC 2001. Data Compression Conference.

[3]  Shmuel Tomi Klein,et al.  Modeling delta encoding of compressed files , 2006, Data Compression Conference (DCC'06).

[4]  Mark Nelson,et al.  The Data Compression Book, 2nd Edition , 1996 .

[5]  Gad M. Landau,et al.  Efficient Special Cases of Pattern Matching with Swaps , 1998, CPM.

[6]  Randal C. Burns,et al.  In-place reconstruction of delta compressed files , 1998, PODC '98.

[7]  Karl R. Abrahamson.  Generalized String Matching , 1987, SIAM J. Comput..

[8]  Dana Shapira,et al.  In-place differential file compression , 2003, Data Compression Conference, 2003. Proceedings. DCC 2003.

[9]  James A. Storer,et al.  Data compression via textual substitution , 1982, JACM.

[10]  Randal C. Burns,et al.  Efficient distributed backup with delta compression , 1997, IOPADS '97.

[11]  Moshe Lewenstein,et al.  Faster algorithms for string matching with k mismatches , 2000, SODA '00.

[12]  Ronald Fagin,et al.  Compactly encoding unstructured inputs with differential compression , 2002, JACM.

[13]  Karan Gupta,et al.  An approximation to the greedy algorithm for differential compression , 2006, IBM J. Res. Dev..

[14]  Walter F. Tichy,et al.  Delta algorithms: an empirical analysis , 1998, TSEM.

[15]  Gad M. Landau,et al.  Efficient String Matching with k Mismatches , 2018, Theor. Comput. Sci..