Bidirectional delta files

Dana Shapira, Michael Kats

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

Abstract

This paper introduces a new method called Bidirectional Delta file, which is to construct a two way delta file out of two given files. Previous work focuses on forwards and backwards delta files. Here we suggest efficiently combining them into a single file. Given two files S and T, the paper designs a greedy algorithm, which produces an efficient bidirectional delta file in terms of the memory storage it requires. Given this encoding file and the original file S, one can decode it in order to produce T, and vice versa. 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.

Original languageEnglish
Title of host publicationProceedings - Data Compression Conference, DCC 2010
Pages249-258
Number of pages10
DOIs
StatePublished - 2010
Externally publishedYes
EventData Compression Conference, DCC 2010 - Snowbird, UT, United States
Duration: 24 Mar 201026 Mar 2010

Publication series

NameData Compression Conference Proceedings
ISSN (Print)1068-0314

Conference

ConferenceData Compression Conference, DCC 2010
Country/TerritoryUnited States
CitySnowbird, UT
Period24/03/1026/03/10

Fingerprint

Dive into the research topics of 'Bidirectional delta files'. Together they form a unique fingerprint.

Cite this