Re: [rdiff-backup-users] Interesting write-up of 'compare-by-hash'.

[Paul P Komkoff Jr]

Replying to Ben Escoto:
> > BitKeeper keeps state about each file under source control and knows
> > what changes have been made since the last time each tree was
> > synchronized. When synchronizing, it sends only the differences
> > since the last synchronization occurred, in compressed form. In
> > comparison to rsync, BitKeeper provides similar and sometimes better
> > bandwidth usage when simply synchronizing two trees without
> > resorting to compare-by-hash.
> 
> Does anyone know how BitKeeper can send only the differences without
> using a compare-by-hash algorithm?  I don't see how this is possible
> unless BitKeeper has abandoned the usual edit w/arbitrary editor and
> then checkin scheme.

I know. bk is a scm. It stores data in sequential format, change by
change. checkpoints is placed between checkins. so, on bk pulls we are
searching for changeset key in history, backwards from present, and
then applying them all in sequential order.

It should be compared with cvs rather than rsync.

-- 
Paul P 'Stingray' Komkoff Jr // http://stingr.net/key <- my pgp key
 This message represents the official view of the voices in my head