[svn.haxx.se] · SVN Dev · SVN Users · SVN Org · TSVN Dev · TSVN Users · Subclipse Dev · Subclipse Users · this month's index

Re: vdelta questions

From: Jim Blandy <jimb_at_savonarola.red-bean.com>
Date: 2000-08-10 17:43:13 CEST

> I've been worrying about something else, though. vdelta expects to
> hash the whole source before starting to generate the delta. So where
> does windowing come into that? Do you take parallel sections of
> both source and target? Oh ... that would be O.K. for small differences,
> and for large unrelated files you'd just get "noisy" compression, right?

According to the VCDIFF draft:

    However, even with a memory-efficient and fast string matching
    algorithm, the computing resource requirements can be prohibitive
    for processing large files. The standard way to deal with this is
    to partition input files into "windows" to be processed
    separately. Here, except for some unpublished work by Vo, little
    has been done on designing effective windowing schemes. Current
    techniques, including Vdelta, simply use windows of the same size
    with corresponding addresses across source and target files.

    String matching and windowing algorithms have large influence on
    the compression rate of delta and compressed files.

So, you've got your work cut out for you. :)
Received on Sat Oct 21 14:36:06 2006

This is an archived mail posted to the Subversion Dev mailing list.

This site is subject to the Apache Privacy Policy and the Apache Public Forum Archive Policy.