Compressed transitive delta encoding

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations


Given a source file S and two differencing files Δ(S, T) and Δ(T,R), where Δ(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 Δ(S,T) in order to construct T and then apply Δ(T,R) on T and obtain R. The Compressed Transitive Delta Encoding (CTDE) paradigm, introduced in this paper, is to construct a delta file Δ(S,R) working directly on the two given delta files, Δ(S,T) and Δ(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.

Original languageEnglish
Title of host publicationProceedings - 2009 Data Compression Conference, DCC 2009
Number of pages10
StatePublished - 2009
Externally publishedYes
Event2009 Data Compression Conference, DCC 2009 - Snowbird, UT, United States
Duration: 16 Mar 201018 Mar 2010

Publication series

NameProceedings - 2009 Data Compression Conference, DCC 2009


Conference2009 Data Compression Conference, DCC 2009
Country/TerritoryUnited States
CitySnowbird, UT


Dive into the research topics of 'Compressed transitive delta encoding'. Together they form a unique fingerprint.

Cite this