[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: Branko Čibej <branko.cibej_at_hermes.si>
Date: 2000-08-10 18:50:31 CEST

Jim Blandy wrote:
> 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.

This is the scheme I'm using right now. With large enough windows,
it shouldn't be such a problem.

> 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. :)

Thanks. Here, we are, on the bleeding edge of technology ...

    Brane

-- 
Branko Čibej                 <branko.cibej@hermes.si>
HERMES SoftLab, Litijska 51, 1000 Ljubljana, Slovenia
voice: (+386 1) 586 53 49     fax: (+386 1) 586 52 70
Received on Sat Oct 21 14:36:06 2006

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